Question: use queue Question 2 Imagine that you are a super rich person and you want to buy a house to your two best friends. You
use queue


Question 2 Imagine that you are a super rich person and you want to buy a house to your two best friends. You want them to be your neighbours. Yet, of course, just because you are rich doesn't mean you have unlimited money, There is a set of prices of houses you can find with similar qualifications like following: (3200000, 3400000 3000000, 4200000, 3500000, 3800000) Design and implement a way of finding the minimum two prices, sum up them, and display. While finding these numbers, make sure that you are using one searching and one sorting algorithm and overall complexity of these algorithms are no more than quadratic time. You should also write your design in a few sentences as a comment. Explain how and why you choose that solution in detail. Your answer: Question 1 Assume that you have the Queue implementation. Write a method in Queue class so that this method checks whether the number that you want to remove is an odd number or not. If the number is odd, remove it; otherwise, keep the number. Return the deleted number if the method can delete it, return -1 elsewhere. (If you do not use Queue, you will not get any credits.). Your answer: Question 2 Imagine that you are a super rich person and you want to buy a house to your two best friends. You want them to be your neighbours. Yet, of course, just because you are rich doesn't mean you have unlimited money, There is a set of prices of houses you can find with similar qualifications like following: (3200000, 3400000 3000000, 4200000, 3500000, 3800000) Design and implement a way of finding the minimum two prices, sum up them, and display. While finding these numbers, make sure that you are using one searching and one sorting algorithm and overall complexity of these algorithms are no more than quadratic time. You should also write your design in a few sentences as a comment. Explain how and why you choose that solution in detail. Your answer: Question 1 Assume that you have the Queue implementation. Write a method in Queue class so that this method checks whether the number that you want to remove is an odd number or not. If the number is odd, remove it; otherwise, keep the number. Return the deleted number if the method can delete it, return -1 elsewhere. (If you do not use Queue, you will not get any credits.). Your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
