Given a list of integers L and a target integer T return true or false if there exists a sublist of integers whose sum is equal to T. For this particular problem, both positive and negative numbers are allowed. To keep things simple, we will assume 0 is not allowed and that T cannot be 0. Let's see some examples of inputs and the expected outputs. Examples Input: L- [1, 2, 3] T-4 Output: True. The sublist [1, 3] sums to 4. Input: L- [5, 1, 6, 7] T-17 Output: False. There are no sublists that have a sum equal to 17. Input: L- [13, 16, -9, 24, -19, 16, -25, -15, 18, 4] T-10 Output: True. A sublist (as there are many) is [13, -19, 16].

Given a list of integers L and a target integer T return true or false if there exists a sublist of integers whose sum is equal to T. For this particular problem, both positive and negative numbers are allowed. To keep things simple, we will assume 0 is not allowed and that T cannot be 0. Let's see some examples of inputs and the expected outputs. Examples Input: L- [1, 2, 3] T-4 Output: True. The sublist [1, 3] sums to 4. Input: L- [5, 1, 6, 7] T-17 Output: False. There are no sublists that have a sum equal to 17. Input: L- [13, 16, -9, 24, -19, 16, -25, -15, 18, 4] T-10 Output: True. A sublist (as there are many) is [13, -19, 16].

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

Given a set of n positive integers, C = {c1,c2, ..., cn} and a positive integer K, is there a subset of C whose elements sum to K? A dynamic program for solving this problem uses a 2-dimensional Boolean table T, with n rows and k + 1 columns. T[i,j] 1≤ i ≤ n, 0 ≤ j ≤ K, is TRUE if and only if there is a subset of C = {c1,c2, ..., ci} whose elements sum to j. Which of the following is valid for 2 ≤ i ≤ n, ci ≤ j ≤ K? a) T[i, j] = ( T[i − 1, j] or T[i, j − ci]) b) T[i, j] = ( T[i − 1, j] and T[i, j − ci ]) c) T[i, j] = ( T[i − 1, j] or T[i − 1, j − ci ]) d) T[i, j] = ( T[i − 1, j] and T[i − 1, j − cj ]) In the above problem, which entry of the table T, if TRUE, implies that there is a subset whose elements sum to K? a) T[1, K + 1] b) T[n, K] c) T[n, 0] d) T[n, K + 1]
Given a set of n positive integers, C = {c1,c2, ..., cn} and a positive integer K, is there a subset of C whose elements sum to K? A dynamic program for solving this problem uses a 2-dimensional Boolean table T, with n rows and k + 1 columns. T[i,j] 1≤ i ≤ n, 0 ≤ j ≤ K, is TRUE if and only if there is a subset of C = {c1,c2, ..., ci} whose elements sum to j. Which of the following is valid for 2 ≤ i ≤ n, ci ≤ j ≤ K? a) ?[?, ?] = ( ?[? − 1, ?] ?? ?[?, ? − ?? ]) b) ?[?, ?] = ( ?[? − 1, ?] ??? ?[?, ? − ?? ]) c) ?[?, ?] = ( ?[? − 1, ?] ?? ?[? − 1, ? − ?? ]) d) ?[?, ?] = ( ?[? − 1, ?] ??? ?[? − 1, ? − ?? ]) In the above problem, which entry of the table T, if TRUE, implies that there is a subset whose elements sum to K? a) ?[1, ? + 1] b) ?[?, ?] c) ?[?, 0] d) ?[?, ? + 1]
Consider the following problem:L is a sorted list containing n signed integers (n being big enough), for example [-5, -2, -1, 0, 1, 2, 4] (here, n has a value of 7). If L is known to contain the integer 0, how can you find the index of 0 ?
Consider the following problem:L is a sorted list containing n signed integers (n being big enough), for example [-5, -2, -1, 0, 1, 2, 4] (here, nhas a value of 7). If L is known to contain the integer 0, how can you find the index of 0 ?
You are given a string X of length n and another string Y of length m ≤n. Say,the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < nand 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.The task is to count the maximum number of non-overlapping sub-sequences of X that are thesame as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB(i.e., among overlapping sub-sequences, you can select only one of them).Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Problem Alice was given a number line containing every positive integer, x, where 1<=x<=n. She was also given m line segments, each having a left endpoint, l (1<=l<=n), a right endpoint, r (1<=r<=n), and an integer weight, w. Her task is to cover all numbers on the given number line using a subset of the line segments, such that the maximum weight among all the line segments in the chosen subset is minimal. In other words, let S=(l1,r1,w1),(l2,r2,w2),....,(lk,rk,wk), represent a set of k line segments chosen by Alice, max(w1,w2,...,wk) should be minimized. All numbers 1,2,....n should be covered by at least one of k the chosen line segments. It is okay for the chosen line segments to overlap. You program should output the minimized maximum weight in the chosen subset that covers all the numbers on the number line, or -1 if it is not possible to cover the number line. Input format The first line of the input contains an integer, n - denoting the range of numbers…
Write a python program based on the discussion we had on the last day of class, to train a network with two hidden layers each with 5 neurons. Finish the gradient computation we did in class, and implement a steepest decent search for a network which minimizes the cost function. Once you believe that your network is trained, compute the value of n(1, 1) and see what you get. Bonus: If you easily get this to work, then try to generalize to K neurons in each of the two hidden layers. Does the training work better with more neurons?
Note: Your solution should have O(n) time complexity, where n is the number of elements in l, and O(1) additional space complexity, since this is what you would be asked to accomplish in an interview. Given a linked list l, reverse its nodes k at a time and return the modified list. k is a positive integer that is less than or equal to the length of l. If the number of nodes in the linked list is not a multiple of k, then the nodes that are left out at the end should remain as-is. You may not alter the values in the nodes - only the nodes themselves can be changed.
Given a non-empty list items of positive integers in strictly ascending order, find and return thelongest arithmetic progression whose all values exist somewhere in that sequence. Return the answer as a tuple (start, stride, n) of the values that define the progression. To ensure unique results to facilitate automated testing, if there exist several progressions of the same length, this function should return the one with the lowest start. If several progressions of equal length emanate from the lowest start, return the progression with the smallest stride. INTRUCTIONS: Input a comment or a solution on how you solve the problem, write a psuodocode and flow chart about th problem
We have a list that stores the repeated heart-rate measurements for the same patient over several tests. Each inner-list is a test and for that test, the heart rate is monitored for some time while taking a few measurements. Next, we would like to calculate the average of the measurements for each test.heart_rate = [ [ 72, 75, 71, 73], # resting[ 91, 90, 94, 93], # walking slowly[ 130, 135, 139, 142], # running on treadmill[ 120, 118, 110, 105, 100, 98]] # after minute recoveryIn your code, define a function calculate_average_heart_rates() that accepts the list heart_rate as its only input argument. Inside the function, use nested loops to calculate the average heart rate during each test scenario. This function should return a list that contains the average heart rate values of a patient for the four test scenarios.Write unit tests
Consider some input string s and some index i. The longestsubstring s[i], ... , s[j − 1] that is a valid expression consists of some number of termsadded together. In all of these cases, it begins with a term. By magic, assume that theGetTerm routine already works. Calling GetTerm(s, i) will return pterm and jterm, wherepterm is the parsing of this first term and jterm indexes the token immediately after thisterm. Specifically, if the expression has another term then jterm indexes the ‘+’ thatis between these terms. Hence, we can determine whether there is another term bychecking s[jterm]. If s[jterm] = ‘+,’ then GetExp will call GetTerm again to get the nextterm. If s[jterm] is not a ‘+’ but some other character, then GetExp is finished readingin all the terms. GetExp then constructs the parsing consisting of all of these termsadded together.
Develop a brute-force algorithm that finds the longest common sequential elements of two given lists with the Java programming language. For example, the following two lists are given: S1 = [B,C,D,A,A,C,D] S2 = [A,C,D,B,A,C] Common lists are: [B,C], [C,D,A,C], [D,A,C], [A,A,C], [A,C], [C,D], … Note that although both lists have a common [C,D,A,C] (sub)list, both list items are skipped and the left-to-right order is intact. Apply the brute force algorithm. Explain Time Complexity?