Learn more about our help with Assignments: Algorithms
Search & Filtering
Algorithms
A food processing company buys plastic bottles for its
products. A plastic manufacturer sells bottles at a price of
85 cents each bottle, if the company orders 1000 bottles
or more. Otherwise the price per bottle is 90 cents. Write
an algorithm and flowchart which determines how much
the company would pay for both cases.
products. A plastic manufacturer sells bottles at a price of
85 cents each bottle, if the company orders 1000 bottles
or more. Otherwise the price per bottle is 90 cents. Write
an algorithm and flowchart which determines how much
the company would pay for both cases.
Algorithms
Write the algorithm of the following:
Problem 01: Your class fellow is not able to join google classroom. Write an algorithm to help her finding a solution of it.
Problem 02: Your younger sibling is not able to download homework task from his/her mail account. Help her to download it. Write an algorithm to find out solution of it.
Problem 01: Your class fellow is not able to join google classroom. Write an algorithm to help her finding a solution of it.
Problem 02: Your younger sibling is not able to download homework task from his/her mail account. Help her to download it. Write an algorithm to find out solution of it.
Algorithms
7.Compute 110101.01102-10110.10102 in octal number system.
8.Compute the value of E7BAD16-E5ACF16 in 15’s complement and write your final answer in binary.
9.Compute the value of 5510-4510 using 7-bit 2’s complement sign magnitude number
8.Compute the value of E7BAD16-E5ACF16 in 15’s complement and write your final answer in binary.
9.Compute the value of 5510-4510 using 7-bit 2’s complement sign magnitude number
Algorithms
7.Compute 110101.01102-10110.10102 in octal number system.
8.Compute the value of E7BAD16-E5ACF16 in 15’s complement and write your final answer in binary.
9.Compute the value of 5510-4510 using 7-bit 2’s complement sign magnitude number
8.Compute the value of E7BAD16-E5ACF16 in 15’s complement and write your final answer in binary.
9.Compute the value of 5510-4510 using 7-bit 2’s complement sign magnitude number
Algorithms
Draw a flow diagram for an algorithm which calculates how many numbers 1, 2, 3…n have to be added to reach a total greater thah 500. Output the answer n.
Algorithms
The IF control structure in psedocode is another way of expressing a nested Case statement?
Algorithms
Solve the following system of linear equations using (a) matrix inversion, and (b) Cramer's rule. [ 1 3 ox] To 0.5 1 y 10.5 0 1Z
Algorithms
(a) Given the following fitness values of points, find the number of local optima (assume
minimization) under (a) the standard decimal (base 10) representation, (b) the standard
binary, and (c) the binary-reflected Gray representation (using 3 bits, that is a 3-dimensional
bit-space for both (b) and (c)). Assume the standard encoding scheme used in class (e.g.,
integer 3 in decimal encoding = string 010 in 3-bit Gray encoding = string 011 in 3-bit binary
encoding). Decimal integers 0 through 7 have the corresponding fitness values 5, 10, 15, 30,
25, 2, 40, 20.
(b) Argue which of the three encoding schemes (integer, conventional binary, and Gray) would
be likely to make it easier for an EA to succeed on this particular problem.
minimization) under (a) the standard decimal (base 10) representation, (b) the standard
binary, and (c) the binary-reflected Gray representation (using 3 bits, that is a 3-dimensional
bit-space for both (b) and (c)). Assume the standard encoding scheme used in class (e.g.,
integer 3 in decimal encoding = string 010 in 3-bit Gray encoding = string 011 in 3-bit binary
encoding). Decimal integers 0 through 7 have the corresponding fitness values 5, 10, 15, 30,
25, 2, 40, 20.
(b) Argue which of the three encoding schemes (integer, conventional binary, and Gray) would
be likely to make it easier for an EA to succeed on this particular problem.
Algorithms
A food processing company buys plastic bottles for its products. A plastic manufacturer sells bottles at a price of 85 cents each bottle, if the company orders 1000 bottles or more. Otherwise the price per bottle is 90 cents. Write an algorithm and flowchart which determines how much the company would pay for both cases.
Algorithms
In this question, you are required to solve the 0-1 Knapsack problem for two knapsacks. You are given a set of n objects. The weights of the objects are w1, w2, . . . , wn, and the values of the objects are v1, v2, . . . , vn. You are given two knapsacks each of weight capacity C. If an object is taken, it may place in one knapsack or the other, but not both. All weights and values are positive integers. Design a Brute force algorithm that determines the maximum value of objects that can be placed into the two knapsacks. Your algorithm should also determine the contents of each knapsack. Justify the correctness and running time of your algorithm.
