A. One greedy strategy to solve the knapsack problem is to consider the items in order of decreasing values of where Vi and Si are the value and the size of item i. For each item, add it to the knapsack if it fits otherwise ignore it and move to the next item in the ordered list. Write a complete pseudocode for this strategy. The pseudocode should print the details of the solution (selected items, their total value and size). B. Show that this strategy does not necessarily yield optimal solutions. Take the example of exercise 1 and change the knapsack capacity to 15 (The value of the optimal solution is 54)..

Q: write a C++ program to combines the three summations and linear search algorithm to find the three…

A: Logic: The idea is to sort an input array and then run through all indices of a possible first…

Q: Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2)…

A: Procedure Followed for Sequential Search: Searching starts from left most of the input array. One…

Q: There are n persons each have 25 paise coins, 50 paise coins and Rs1 coins in the ratio p:q:r but…

A: The ask is to write a C program to find and print no. of 25 paise coins, 50 paise coins and 1 Rs…

Q: A binary search only works if the values in the list are sorted. A bubble sort is a simple way to…

A: Bubble sort as well explained in the question, it is the comparison between the two successor…

Q: Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2,…

A: Below is the python program with output screenshot

Q: A. One greedy strategy to solve the knapsack problem is to consider the items in order of decreasing…

A: (A)   // C/C++ program to solve fractional Knapsack Problem #include <bits/stdc++.h> using…

Q: 2. A celebrity among a group of n people is a person who knows nobody but is known by everybody…

A:

Q: Write an efficient algorithm (to the best of your knowledge) for the following problem, briefly…

A:

Q: 6. There are currently several online newspapers in Bangladesh, such as prothom Alo, bdnews24, daily…

A: In order to group a set of data possessing similar behaviour we could use clustering. Clustering is…

Q: 9. Voting Suppose that the votes of n people for different candidates (where there can be more than…

A:

Q: (b). write an algorithm for Given a set of distinct, positive integers x1, x2, x3, ...xn, where n is…

A: (b). write an algorithm for Given a set of distinct, positive integers xl, x2, x3, ...xn, where n is…

Q: Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE otherwise.…

A: Step 1   The code is below :   Considering the length of each string .   Step 2   import java.io.*;…

Q: 3. Draw the Flow Graph and then determine the Cyclomatic complexity of the following program. int…

A: Here we draw the flow graph: ==========================================================

Q: An artificial intelligence system was design to forecast the financial trading market and predict…

A: All the answers are given below :

Q: Problem 2: Search an Array Considering the search problem, we have a list of n integers A = (v1, v2,…

A: Lets First Talk About Python Python is a high-level abstraction general-purpose programming…

Q: Consider the problem of calculating the median m of the following numbers: 4,5,9. (a) Write down the…

A:

Q: Rivet-Shamir Adleman(RSA) algorithm is an example of encryption algorithm which is based on public…

A: RSA Algorithm : It is a asymmetric cryptography which uses two keys - public key and private key.…

Q: A. One greedy strategy to solve the knapsack problem is to consider the items in order of decreasing…

A: (A)// C/C++ program to solve fractional Knapsack Problem #include <bits/stdc++.h> using…

Q: as a pivot is a very effective strategy for Quicksort. C. Both Quicksort and Insertion sort are

A: Explanation: Because Quick Sort has extra cost from the recursive function calls, insertion sort is…

Q: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the simultaneous…

A: Given: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the…

Q: Below are a number of statements about sorting algorithms. Which of the above statements is correct?…

A: Find the answer with explanation given as below :

Q: We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that…

A: ANSWER:-

Q: A word can be changed to another word by 1-letter substitution. Assume that a dictionary of…

A: This is a graph problem that can be modelled. Words can be thought of as graph nodes, with two nodes…

Q: b) You are given the task of analyzing how joyful a person is. If you are given a list of numbers…

A: #include <bits/stdc++.h>using namespace std; int findMinDivisor(int arr[], int n, int limit){…

Q: There are n persons each have 25 paise coins, 50 paise coins and Rs1 coins in the ratio p:q:r but…

A: #include <bits/stdc++.h> using namespace std; // function to calculate coin. int coin(int…

Q: How many times will the innermost loop be iterated when the algorithm segment is implemented and…

A: For each i, the statements are executed once. As i runs from j to n this…

Q: the task of analyzing how joyful a person is. If you are given a list of numbers that represent the…

A: I have written code for it below:

Q: Apply algorithm 4.3.2 in P.155 with n=6 and A=(3,5,4,1,3,2). Draw only the right half of the…

A: I'm providing the answer for the above question. I hope this will be helpful for you.

Q: Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the…

A: The inputs are the x and y coordinates of three points and the output is statement whether the…

Q: Here is my question that my professor gave to me as a homework from my algorithm's class. Use…

A: Asymptotic Notation: The  behavior of a Asymptotic function is that allows us to see how it will…

Q: A formula for finding the greatest common divisor (GCD) of two numbers was formulated by the…

A: Given  : Values of a and b. Output : GCD of a and b using recursive function.

Q: We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that…

A: The correct answer for the above mentioned question is given in below steps.

Q: Problem 2: Search an Array Vn). We want Considering the search problem, we have a list of n integers…

A: Pseudocode: LinearSearch(A, ν):    for i = 0 to A.size()-1:         if A[i] == ν           return i…

Q: Write an algorithm (pseudo-code) that takes an unsorted list of n integers and outputs a sorted list…

A: ALGORITHM:- Array: arr[0...n-1] After this, create an count array: cont[0...n-1]. After this,…

Q: I am stuck on this Problem.. Theory Of Computation.. Write pseudocode for an algorithm relies on R…

A: Ans: Introduction to Computational Theory Automata theory (also known as Theory Of Computing) is a…

Q: design an algorithm to find all the common elements in two sorted lists of numbers. For example, for…

A:

Q: The complexity of an algorithm may be specified using the Big-Oh notation or simply O notation. The…

A: here we have some time complexity discussions.

Q: write algorithm or theory of the following problem. Dont write code, Narrative 2: We need to have a…

A: Algorithm is a step by step procedure for solving a problem

Q: We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that…

A: Note : Put Main.java and TestInput.txt in same folder   1. Then open command prompt go the folder…

Q: 4.11 Exercise: Suppose Algorithm A takes 3n³+5n²+100n time and Algorithm B takes 4n³ time…

A: The Java code to check if g(n) will rise above f(n) i.e. g(n) > f(n) for which value of n has…

Q: This algorithm lists the number of strings formed from the symbols in set D (defined below) of…

A: Since we are dealing with one string at a time and printing them, the length of the string doesn't…

Q: Count divisibles in range

A: Note: The provided solution is correct as per the question requirements. If you need further…

Q: Give an example of a dynamic, quicksort algorithm and a greedy algorithm. Don't forget to include…

A: here we have given example with explanation of quick sort algorithm and a greedy algorithm

Q: valid if each character in the string can be paired with another character in the string, where the…

A: Q. Given: List L of pairs of characters String S Output: TRUE if S is a valid string, FALSE…

Q: Big-O Coding Exercise Show your solution and explanations. Problem 6 def oneloop (n) : while n != 1:…

A: We need to find the time complexity of the given code.

Q: Sort the functions in ascending order of growth rate, that is, the slowest growing one is 1, and so…

A: Sort the functions in ascending order of growth rate, that is, the slowest growing one is 1, and so…

Q: Exercise 4. DYNAMIC PROGRAMMING: COUNTING CERTAIN DNA SEQUENCES. DNA strings use the alphabet A, C,…

A: Program to print DNA sequence Given the value of n i.e, the number of lobes. Print the double-helix…

Q: USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be…

A: The Answer is

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.