Explanation of Solution
Extract the collection of numbers from the given list whose sum is 3165:
The given list of numbers is,
The target number is 3165.
It is clear that the target value will be the sum of the larger numbers and in this given list the sum of the two largest numbers is less than the required sum. So, it would be appropriate to check for a match from the end of the list.
It can be seen that, the last digit of the target value 3165 is 5. So, it will be appropriate to check the sum of those numbers which last digit is 5.
In the first attempt, we check the sum of numbers 1677,995 and 793 from the list,
The above sum is greater than the target value so, we then select the numbers 1156, 995 and 504 and then perform the addition operation.
Since, this value is less than the target value now we check for groups of 4 numbers and then apply the same operation
Want to see the full answer?
Check out a sample textbook solutionChapter 5 Solutions
Computer Science: An Overview (12th Edition)
- please using Searching Algorithms to find the answers What are those possible 4 numbers? There are 4 numbers (from 1 to 20) Summation of all 4 numbers is more than 40 Multiplication of all 4 numbers is less than 6,000arrow_forwardplease show the steps Q5- find the complexities based on theta notation ? a-f(X)=3n^2 +10n log n +1000n+4 log n +999 b- f(X)= (log n)^2 +2n+4n+log n +50 c-f(X)= n+ n^2 + 2^n + n^4arrow_forwardHow to correct this given error?arrow_forward
- how binary number is converted into grey code into binary number ? example your answer with least two example ?arrow_forwardWhat is the largest n for which one can solve withina minute using an algorithm that requires f(n) bit operations, where each bit operation is carried out in10^(−12) seconds, with these functions f(n)? a) log n b) n^2 c ) 2^narrow_forwardHow to solve this error?arrow_forward
- please answer with proper explanation and step by step solution. The answer is not 0.04. I think it has something to do with the base-10 but I'm not sure. Could somebody help me pls.arrow_forwardUse the polynomial 10101010 for each of the comparisons. Fill in the table below with the value of Hamming distance: Transmitted Codeword Transmitted distance Received Codeword Received distance Codeword Rejected? ‘T’ 10101001 10101111 ‘i’ 11010010 11110010 ‘m’ 11011011 11011011 ‘e’ 11001010 01001011arrow_forwardWhat is the minimum number of multiplications needed to generate x60 when starting from x? (you may only use terms of x to solve this problem, x * x = x2 is one multiplication, x2 * x2 leaves us at 2 multiplications, …)arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education