Search & Filtering
Client loves numbers so much that he tries to find some quirky math bricks whenever he can. One day, he decides to take up a number and tries to find out its largest prime divisor. Note: Largest prime divisor has to be greater that 1 and less than the number itself. If there is no such divisor then return -1.
Create a program that will prompt the user to enter a number in the range 1-100 to find my favourite number. If the number is less than favourite number, print “Too low...guess again: ”. If the number is greater than favourite number, print “Too high...guess again: ”. Ask again and exit until the number entered is the correct favourite number. in C++ program (while loop)
write a program that prompts the user to enter the age of a customer.if the age is younger than 15 then ask the user to enter the name of the customer and notify them by name that they qualify a free toy
monica has cooked n dishes and collected the data on the level of satisfaction for all the dishes from a guest. the guest returns an array, where the ith element of the array is the liking level of the ith dish. also, the time taken to cook the ith dish is i. like-to-time coefficient of a dish is calculated by multiplying the time taken to cook food with its liking level, i.e., input 2[i]. totally like-to-time coefficient is calculated by summing up all individual coefficients of dishes. you want the total like-to-time coefficient to be maximum. you can also remove some dishes, in which case, a new coefficient is calculated using the left dishes. find the maximum sum of all possible like-to-time coefficients.program done by using functions.
Suppose binary search technique is applied to the array NAME (Allen, Clark, Dickens, Edwards, Goodman, Hobbs, Irwin, Klein, Lewis, Morgon, Richard, Scott, Tucker, Walton) . Find the ends BEG and END and middle MID for the rest segment in each step of an algorithm
Suppose NAME is a 8 element array and 5 elements (Brown,Davis,Johnson,Smith,wagner)are in array observe that names are listed alphabetically and keep it alphabetical all times suppose ford and Taylor are added to the array and Davis removed from array
Consider the following declaration. For each of the following statements (a) to (f) write a
single statement to perform the indicated task.
float number1 = 7.3, number2;
(a) Declare the variable fPtr to be a pointer to an object of type float.
(b) Assign the address of variable number1 to pointer variable fPtr.
(c) Print the value of the object pointed to by fPtr together with a suitable message.
(d) Assign the value of the object pointed to by fPtr to the variable number2.
(e) Print the address of number1 together with a suitable message.
(f) Print the value stored in fPtr together with e suitable message
How we will ensure that workers in South Africa that are likely to be the hardest hit are protected?[15]
What role should unions play in this new world? Is there a risk that unionization speeds up the automation?[15]
Should there be an additional tax in creation of automated systems? [10]
