Given a set of pairs. {(136, 34), (195, 15), (125, 25), (216, 12), (360, 30) } The first component in a ordered pair is the value of an item and the second the component is the weight (ponds) of the item. The value of a thief can get if he can carry is. if the maximum weight is 50 ponds by by applying the greed algorithm 0-1_KNAPSACK. 311 O 411 527 633 none of these

Given a set of pairs. {(136, 34), (195, 15), (125, 25), (216, 12), (360, 30) } The first component in a ordered pair is the value of an item and the second the component is the weight (ponds) of the item. The value of a thief can get if he can carry is. if the maximum weight is 50 ponds by by applying the greed algorithm 0-1_KNAPSACK. 311 O 411 527 633 none of these

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 7PE

See similar textbooks

Similar questions

The 9-entry hash table that results from using the hash function, h(i) = (2i+7) mod 9, to hash the keys 12, 5, 13, 4, 10, 19, 8, 3, and 28, assuming collisions are handled by linear probing as follows: 0 1 2 3 4 5 6 7 8 10 19 3 28 12 8 13 4 5 group answer choice a) True b) False
Given an array A {361,313, 163,179, 334, 659, 969, 934} and a hash functionh(x) = (x mod 11), show the results: (The answers must show where the collision occurs.) (1). Separate chaining hash table. (2). Hash table using linear probing. (3). Hash table using quadratic probing. (c1 = 0, c2 = 1) (4). Hash table with second hash function h2 (x) = 7 − (x mod 7).
1. Given the hash function: h(i) = i % 13 and double hash function: d(i) = 1 + i % 12.Show the array after inserting the following keys: 18, 26, 35, 9, 64, 47, 96, 36, 70 , in this order. Use double hashing to resolve collisions. 2. Given the hash function: h(i) = i % 10Show the array after inserting the following keys: 24, 42, 34, 62, 73, 90, 65, 55 in this order. Use quadratic probing to resolve collisions.
Correct answer will be upvoted else downvoted. Computer science. You are approached to pick some integer k (k>0) and find a succession an of length k with the end goal that: 1≤a1<a2<⋯<ak≤|s|; ai−1+1<ai for all I from 2 to k. The characters at positions a1,a2,… ,ak are taken out, the excess characters are linked without changing the request. Thus, at the end of the day, the situations in the arrangement an ought not be contiguous. Allow the subsequent to string be s′. s′ is called arranged if for all I from 2 to |s′| s′i−1≤s′i. Does there exist such a grouping a that the subsequent string s′ is arranged? Input The main line contains a solitary integer t (1≤t≤1000) — the number of testcases. Then, at that point, the portrayals of t testcases follow. The main line of each testcase contains a string s (2≤|s|≤100). Each character is either '0' or '1'. Output For each testcase print "YES" if there exists a grouping a to such an extent that…
Implement a commonly used hash table in a program that handles collision using linear probing. Using (K mod 13) as the hash function, store the following elements in the table: {1, 5, 21, 26, 39, 14, 15, 16, 17, 18, 19, 20, 111, 145, 146}. Use c++
#. Consider a hash table of size 11 with hash function h(x) = x mod 11.Draw both hash tables (Closed-Bucket and Open-Bucket) that results after inserting, in the given order, the following values: 45, 12, 35, 67, 25, 52, 88, 70, 68, 53, 55
In Python, implement a hashing table data structure of size 20, which can cope with collisions. Thus, you must implement the closed collision system in its three modes: Linear scanQuadratic scanDouble hashing scan. For halt use halt(k)= (k mod (m - 1)) + 1, where m is the size of the table. The data to be managed are students from a certain university who have a 5-digit registration number and it is unique. In addition, the student has a name, age and address. Create a .txt file with 10 students (one for each line) and have them loaded into your program. Build a menu of options where you can: - Find a student and print his data if found and position in the table. Otherwise print a "Not Found" message.
In Python, implement a hashing table data structure of size 20, which can cope with collisions. Thus, you must implement the closed collision system in its three modes: Linear scanQuadratic scanDouble hashing scan. For halt use halt(k)= (k mod (m - 1)) + 1, where m is the size of the table. The data to be managed are students from a certain university who have a 5-digit registration number and it is unique. In addition, the student has a name, age and address. Create a .txt file with 10 students (one for each line) and have them loaded into your program. Build a menu of options where you can: - Enter a new student. For this option, that only allows entering the 5-digit license plate and that random data is automatically generated for the name, age and address. Return the position where it was entered and if it is not possible to enter it, print a message that explains why the entry was not obtained.
Create an SP client that analyses the edge-weighted digraph's edges in relation to a specified pair of vertices, s and t: Create a V-by-V boolean matrix where each item in row v and column w is true for each v and w if the edge v->w is an edge in the edge-weighted digraphs whose weight can be raised without increasing the length of the shortest path from v to w, and false otherwise.
Computer Science Please finish the template that i provide. #includeclass Nurikabe{public:/*n is the size of the Nurikabe, n >= 5, n <= 20game is the result from some playerhere is one examplen: 5game = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };W represent wall*/Nurikabe(char game[20][20], int n){}/*return 1 if result fit the rule.return 0 if result not fit the rule.*/int isCorrect(){}private://請設計你自己的資料結構來儲存遊戲的結果//Please design your own data structure to keet the result};int main() {int n, j, l, k;char game[20][20] = { {'W', 'W', 'W', '1', 'W'},{'W', '.', 'W', 'W', 'W'},{'W', '2', 'W', '.', '3'},{'3', 'W', 'W', '.', 'W'},{'.', '.', 'W', 'W', 'W'} };std::cin>>n;for(j = 0;j < n;j ++)for(k = 0;k < n;k ++)std::cin>>game[j][k];Nurikabe *a = new Nurikabe(game, n);std::cout<iscorrect();return 0;}
Implement a commonly used hash table in a program that handles collision using linear probing. Using (K mod 13) as the hash function, store the following elements in the table: {1, 5, 21, 26, 39, 14, 15, 16, 17, 18, 19, 20, 111, 145, 146}.
Consider a open bucket hash table and closed bucket hash table in which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100; hash(id) = first two digits of id #. Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023. Use following function as second hash function hash(id) = last digit of id # Show the effect of deleting 000014 from the hash table. (Java Programming DSA)