You are given n integer numbers (n> 2), operators (+ - *), and a goal number. You will use the given numbers and pick these binary operators in a certain order such that your result will be close to the goal number as much as possible. You cannot use the same number twice, but you do not need to use all the numbers. You should use each operator at least once. Example: Inputs = {3, 7, -1, 13), Target = 121, A possible solution is: ((13) + (−1)) * ((7) + (3)) = (12) * (10) = 120 What kind of problem is this? Should we use algorithmic or a data-driven approach? Why? Which method we should use? What will be the computational complexity of the method you preferred? Explain in detail.

You are given n integer numbers (n> 2), operators (+ - ), and a goal number. You will use the given numbers and pick these binary operators in a certain order such that your result will be close to the goal number as much as possible. You cannot use the same number twice, but you do not need to use all the numbers. You should use each operator at least once. Example: Inputs = {3, 7, -1, 13), Target = 121, A possible solution is: ((13) + (−1)) ((7) + (3)) = (12) * (10) = 120 What kind of problem is this? Should we use algorithmic or a data-driven approach? Why? Which method we should use? What will be the computational complexity of the method you preferred? Explain in detail.

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

Similar questions

3. Card Flipper: You walk into a room, and see a row of n cards. Each one has a number x; written on it, where i ranges from 1 to n. However, initially all the cards are face down. Your goal is to find a local minimum: that is, a card i whose number is less than or equal to those of its neighbors, xj-1 = X; <= Xj+1. The first and last cards can also be local minima, and they only have one neighbor to compare to. There can be many local minima, but you are only responsible for finding one of them. Obviously you can solve this problem by turning over all n cards, and scanning through them. However, show that you can find such a minimum by turning over only O(log n) cards.
thello is a board game and you are expected to implement the move function for this game. Arguments passed to the function are - a symbol of the player making the move and x y coordinates of the cell at which the player wishes to make the move. The move function will be returning a boolean, false - if the move isn't feasible and true - if the move is feasible and this function will also make the move then i.e. make the required changes in the board. Input Format: Line 1: Integer n (Total number of moves) Line 2: Player 1 coordinates, x and y (Two integers separated by space) Line 3: Player 2 coordinates, x and y (Two integers separated by space) Note 1: Number of moves (i.e. n) is always even and Player 1 always starts the game. Note 2: If any player's coordinates are not valid, enter again till the right move. Main function is given for you reference. Sample Input: 2 24 15 25 Sample Output: 00000000 00000000 00001000 00011000 00021000 00000000 00000000 00000000 false 00000000 00000000…
Computer Science You are playing the popular card game “Inscribings”. In this game, your opponent places n monster cards onto the board, the ith of which has hi health points. You in turn have m ≥ n hero cards in your hand, the jth of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer. If it is possible, your algorithm must also return any such assignment. Need an algorithm which runs in Θ(m log m) time.
[Fish Tank] You play with a clown fish that has an initial size so. The fish can eat other fish in a tank organized in m columns and n rows. The fish at column i and row j has a positive size si,j. When your fish eats another fish, it grows by that amount. For example, if your clown fish has a size of 10 and eats a fish of size 5, it becomes of size 15. You cannot eat a fish that is bigger than your size. The game starts by eating any fish in the first (left-most) column that is not bigger than yours. After that, you advance one column at a time by moving right. You have only three allowed moves. You either stay at the same row, move one row higher or one row lower. You will always move to the right. Thus, you will make exactly m moves to advance from left to right. Your goal is to exit the fish tank from the right with the biggest possible size. The figure below shows an example with the best answer highlighted. In this case, the final fish size is 71 (10+8+7+24+22). You are required…
Write in C++ Alice is trying to monitor how much time she spends studying per week. She going through her logs, and wants to figure out which week she studied the least, her total time spent studying, and her average time spent studying per week. To help Alice work towards this goal, write three functions: min(), total(), and average(). All three functions take two parameters: an array of doubles and the number of elements in the array. Then, they make the following computations: min() - returns the minimum value in the array sum() - returns the sum of all the values in the array average() - returns the average of all the values in the array You may assume that the array will be non-empty. Function specifications: Function 1: Finding the minimum hours studied Name: min() Parameters (Your function should accept these parameters IN THIS ORDER): arr double: The input array containing Alice's study hours per week arr_size int: The number of elements stored in the array Return Value:…
Q3: Interplanetary Spaceflight Milan Tusk is the richest person in the universe. After devoting decades of his life to further our space exploration technologies, he’s finally ready to retire. Being a space enthusiast, the first thing he wants to do is visit n planets p1, p2, …, pn, in this order. He’s currently on planet p0. Milan knows that the distance between planets pi and pi + 1 (for 0 ≤ i < n) is d[i]light years. His spaceship uses 1 tonne of fossil fuels per light year. He starts with a full tank and can fill up his tank at any of the n planets (but he must not run out in between two planets). There’s a huge cost to set up the spaceship for refuelling. Due to financial constraints (he’s not THAT rich), he can fill up his tank at most ktimes. In order to save money and make his spaceship lighter, Milan is looking for the smallest possible fuel tank that enables him to complete his space travel and reach planet pn. What is the smallest tank capacity that enables him to do so?…
Assuming that you have the functions "drawPolygon(int[] x, int[] y, int n)" for drawing polygon, "drawRectangle(int x, int y, int width, int height)" for drawing rectangle and "drawCircle(int xc, intyc, int radius)" for drawing circle; draw the given shape. Where: R(300,250), T1(325,275), T2(475,275), T3(400,400), Pı(285.250), P2(225.275), P3(200,450), P4(285, 300), Q1(515,250), Q2(575,275), Q3(600,450), Q4(515,300) C6: (300,75), R=50 C7: (500,75), R=50 C1: (400,150), R=100 С4: (350,150), R-10 C5: (450,150), R=10 C2: (400,195), R=50 C3: (400,175), R=30 C8: (400,225), R=15 P1 R P2, T2 P4 Q2 Q4 T3 Pa 200
6. What is the difference between if (p { }? == q) {...} and if (*p == *q)
X4: teaParty Write a function in Java that implements the following logic: We are having a party with amounts of tea and candy. Return the int outcome of the party encoded as 0 = bad, 1 = good, or 2 = great. A party is good (1) if both tea and candy are at %3D least 5. However, if either tea or candy is at least double the amount of the other one, the party is great (2). However, in all cases, if either tea or candy is less than 5, the party is always bad (0). Your Answer: 1 public int teaParty(int tea, int candy) 2 { 3 4 }
We need to have a struct called ROOM that has width and length defined. This struct represents a rectangular room. From room we need to define:Bathroom, Livingroom, Bedroom and Kitchen.Given that we have the following house :Bedroom1 (L=15,W=10)Bathroom1 (L=10,W=7)Kitchen1(L=15, W= 10)Livingroom1 (L=25,W=20 We also know that in acertain area in Orange County, CA all homes are above 1300 square feet. Could this house above be in this area of Orange County? You must display your result including the square feet of the house above.
C++ Programming Lab 1: Harry Potter dreams himself in a witchy magic shop, it contains an infinite amount of Golden Snitch. He is allowed to select n Golden Snitch. There are Golden Snitch of k different sizes. From each size there are also infinitely many Golden Snitch. Harry Potter wants to have at least one snitch of each size, but still there are a lot of possibilities for his selection. In his effort to make a decision he wakes up. Now he asks your help to develop a C++ program to find out how many possibilities for his selection he would have had. Assume that Golden Snitch of equal size can't be distinguished, and the order of the Golden Snitch is irrelevant. No. Test Case Result 1 30 7 475020
computer science | c++ code | it's not graded. Correct answer will upvoted else downvoted. It is given a non-negative integer x, the decimal portrayal of which contains n digits. You need to shading every its digit in red or dark, so the number shaped by the red digits is separable by A, and the number framed by the dark digits is detachable by B. No less than one digit should be shaded in every one of two tones. Consider, the include of digits hued in red is r and the include of digits hued in dark is b. Among all potential colorings of the given number x, you need to output any to such an extent that the worth of |r−b| is the base conceivable. Note that the number x and the numbers shaped by digits of each tone, may contain driving zeros. Input :The principal line contains one integer t (1≤t≤10) — the number of experiments. Then, at that point, t experiments follow. Each experiment comprises of two lines. The main line contains three integers n, A, B (2≤n≤40, 1≤A,B≤40).…