You are going to purchase items from a store that can carry a maximal weight of 'w' into your knapsack. There are 5 items in store available and each items weight are Wi and the worth of these items are Pi dollars. What items should you take and how using Knapsack algorithm? The weight of knapsack depend upon the sum of your two digits of age for example suppose your age is 25 then sum of age becomes 7. The list of items and their respective weight with price are given in table. Items Weight Price A Total count of your first name Total count of your first name divide by 2 B 3 Your roll no mod 5 C Second digit of your roll no 5 D Total count of your last name Total count of your first name divide by 2 E Your roll no mod 3 S Sum of roll no mod 13

You are going to purchase items from a store that can carry a maximal weight of 'w' into your knapsack. There are 5 items in store available and each items weight are Wi and the worth of these items are Pi dollars. What items should you take and how using Knapsack algorithm? The weight of knapsack depend upon the sum of your two digits of age for example suppose your age is 25 then sum of age becomes 7. The list of items and their respective weight with price are given in table. Items Weight Price A Total count of your first name Total count of your first name divide by 2 B 3 Your roll no mod 5 C Second digit of your roll no 5 D Total count of your last name Total count of your first name divide by 2 E Your roll no mod 3 S Sum of roll no mod 13

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Interest on a credit card’s unpaid balance is calculated using the average daily balance. Suppose that netBalance is the balance shown in the bill, payment is the payment made, d1 is the number of days in the billing cycle, and d2 is the number of days payment is made before billing cycle. Then, the average daily balance is: averageDailyBalance =netBalance x d1-payment x d2d1 If the interest rate per month is, say, 0.0152, then the interest on the unpaid balance is: Interest= averageDailyBalance * 0.0152 Write a program using c++ compiler that accepts as inputnetBalance, payment, d1,d2, and interest rate per month. The program outputs the interest. Format your output to two decimal places.
Algorithms Question Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.
Correct answer will be upvoted else Multiple Downvoted. Computer science. You are given a positive number x. Observe the littlest positive integer number that has the amount of digits equivalent to x and all digits are unmistakable (extraordinary). Input The principal line contains a solitary positive integer t (1≤t≤50) — the number of experiments in the test. Then, at that point, t experiments follow. Each experiment comprises of a solitary integer number x (1≤x≤50). Output Output t replies to the experiments: on the off chance that a positive integer number with the amount of digits equivalent to x and all digits are diverse exists, print the littlest such number; in any case print - 1.
The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: 1. Compute the remainder of dividing the larger number by the smaller number. 2. Replace the larger number with the smaller number and the smaller number with the remainder. 3. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5
1. Both mergesort and quicksort uses divide and conquer paradigm to sort unsorted list. (a) Imagine you want to write the quicksort algorithm to sort an array into non-increasing order. Write down the partition algorithm that is used in the divide phase in the quicksort algorithm. Show that the time complexity of this algorithm is 0(n). (b) Identify the worst case situation in the naive quicksort algorithm and show that in the worst case situation its time complexity is O(n2)
Dynamic Programming: Two coins X and YFlip coin X: gain 1 point for the head, and lose 1 point for the tailFlip coin Y: gain 3 points for the head, lose 3 points for the tail. After n round, if the final score is positive, you win. Otherwise, you lose. The score does not matter. Pr(s) be the probability of winning; r is the round; s is the score.P0(s) = 1 for s >= 1; P0(s) = 0 if s <= 0. a. Explain why P1(s) = 0 when s <= -3; P1(s) = 0.5 when -2 <= s <= 1; P1(s) = 1 for s >= 2. b. Explain why you must select X if s is 2 or 3, and you must select Y if s is −2 or −1. b. Determine P2(s) for each possible value of s and explain. (each probability will be one of 0, ¼, 1/2, ¾, 1) c. Fine a recurrence relation for Pr(s) with form Pr(s) = max[(?+?)/2, (?+?)/2]. Explain. d. Use Dynamic Programming to compute probability P100(0) (win the game if it has 100 rounds).
Max Jones belongs to a CD (compact disc) club that allows him to buy CDs at a much lower price than his local music store charges. He wants to know how much he saves by buying all of his CDs through the club rather than through the music store. The output is the savings. The input is the number of CDs purchased, the club CD price, and thestore CD price. The algorithm should use two processing items: one for the cost of buying the CDs through the club, and the other for the cost of buying the CDs through the store. Write the algorithm using pseudocode.
Your team was asked to program a self-driving car that reaches its destination with minimum travel time. Write an algorithm for this car to choose from two possible road trips. You will calculate the travel time of each trip based on the car current speed and the distance to the target destination. Assume that both distances and car speed are given
In a candy store, there are N different types of candies available and the prices of all the N different types of candies are provided to you. You are now provided with an attractive offer. You can buy a single candy from the store and get at most K other candies ( all are different types ) for free. Now you have to answer two questions. Firstly, you have to find what is the minimum amount of money you have to spend to buy all the N different candies. Secondly, you have to find what is the maximum amount of money you have to spend to buy all the N different candies. In both the cases you must utilize the offer i.e. you buy one candy and get K other candies for free. Example 1: Input: N = 4 K = 2 %3D candies[] = {3 2 1 4} Output: 3 7
Control Loops: A high school 1000 students and 1000 lockers. The principal plays the following game: She asks dthe first student to open all the lockers. Shen then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game . In general, the nth student checks every nth locker. If the locker is open, the student closes it; if it is closed, the student opens it. After all the students have taken their turns, some of the lockers are open and some are closed. Write a program thatprompts the user to enter the number of lockers in a school. After the game is over, the program outputs the number of lockers and the locker numbers of the lockers that are open. Test run your program for the following inputs: 1000, 5000, 10,000. Do you see any pattern developing for the locker numbers that are open in the output?…
Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways to change the coins: • flip over any ten coins, or • place n+ 1 additional coins, all showing tails, on the table where n is the number of heads currently showing on the table. For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails, then add 91 tails, yielding 90 heads and 103 tails. (a) Model this situation as a state machine, carefully defining the set of states, the start state, and the possible state transitions. (b) Optionally, explain how to reach a state with exactly one tail showing. (c) Consider the following derived variables: C ::= the number of coins on the table H ::= the number of heads on the table T::= the number of tails on the table C, ::= parity (C) H2 ::= parity(H) T2 ::= parity(T) Here the parity : Z → {0,1} function is defined as parity(n) = 0 when n is even and 1 otherwise. Which of these variables is strictly…
Ramesh as the school teacher want to find which student has highest height. So we take the height of students in random order. Your task is to find the maximum height of the student and print. It. In kotlin

SEE MORE QUESTIONS

Recommended textbooks for you

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

SEE MORE TEXTBOOKS

GET THE APP

About FAQ Academic Integrity Sitemap Document Sitemap

Contact Bartleby Contact Research (Essays)High School Textbooks Literature Guides Concept Explainers by Subject Essay Help Mobile App

GET THE APP

Privacy

Your CA Privacy Rights

Your NV Privacy Rights

About Ads

Manage My Data

bartleby, a Learneo, Inc. business

Items	Weight	Price
A	Total count of your first name	Total count of your first name divide by 2
B	3	Your roll no mod 5
C	Second digit of your roll no	5
D	Total count of your last name	Total count of your first name divide by 2
E	Your roll no mod 3 S	Sum of roll no mod 13