Register

GATE Overflow Test Series | Algorithms | Test 1 | Question: 20

262 views
3 votes
3 votes
Suppose you are having $5$ notes each with denominations of $2000,500,300$ and $50$ and you are asked to make a sum of Rs. $4650.$ For each note you choose you are asked to pay a service charge of Rs. $2.5$ which is irrespective of the denomination of the note. What will be the minimum amount in rupees you'll have to pay as service charge?
User Avatar

1 Answer

3 votes
3 votes
$2 \times 2000 + 2 \times 300 + 1 \times 50 = 4650.$
So, $5$ notes in minimum $\implies 5 \times 2.5 = 12.5$
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
2 answers
1
gatecse asked Aug 18, 2020
159 views
GATE Overflow Test Series | Algorithms | Test 1 | Question: 6
Consider a min heap implemented as an array with the elements $1,2,3,6,7,8,9,10.$ The level (starting from 1) in which $7$ is stored is _______
Consider a min heap implemented as an array with the elements $1,2,3,6,7,8,9,10.$ The level (starting from 1) in which $7$ is stored is _______
User Avatar
3 votes
3 votes
2 answers
2
gatecse asked Aug 18, 2020
145 views
GATE Overflow Test Series | Algorithms | Test 1 | Question: 8
Consider the binary tree shown below, which is an almost max-heap with the node $22$ violating the max-heap property. Once heapify procedure is applied to it, which position will it be in?
Consider the binary tree shown below, which is an almost max-heap with the node $22$ violating the max-heap property. Once heapify procedure is applied to it, which posit...
User Avatar
4 votes
4 votes
1 answer
3
gatecse asked Aug 18, 2020
638 views
GATE Overflow Test Series | Algorithms | Test 1 | Question: 9
In a hashtable with $20$ slots $30$ records are inserted with collisions being resolved by chaining. What is the expected number of key comparisons in an unsuccessful search assuming uniform hashing?
In a hashtable with $20$ slots $30$ records are inserted with collisions being resolved by chaining. What is the expected number of key comparisons in an unsuccessful sea...
User Avatar
Link Copied!