Assume the existence of two type of tables, where the shorter one is of length X...

 

Transcribed Image Text:

Assume the existence of two type of tables, where the shorter one is of length X and the longer on is of length Y. A combination of these two types of tables are aligned to fill a given distance D. Using as few tables as possible, find the optimum combination to keep the remaining empty distance is as small as possible. [note: the first priority is to minimize the empty distance, and the second priority is to minimize the number of used tables] X" D Examples: Input: X 3, Y = 5 , D = 24 The optimum combination is: TX = 3, TY = 3, RD = 0 It means: three tables of size X (TX), three tables of size Y (TY), and remaining distance (RD) is 0. 3*3+3 5 = 24 So empty distance = 24 - 24 0 Input: X = 3, Y = 9, D = 29 Output: TX =0, TY = 3, RD = 2 It means: zero tables of size X (TX), three tables of size Y (TY), and remaining distance (RD) is 2. 0* 3+3*9 = 27 So empty distance = 29 - 27 = 2 a) Design an algorithm (pseudocode) to solve the above problem (2 marks), b) Implement your solution using Python (2 marks) Assume the existence of two type of tables, where the shorter one is of length X and the longer on is of length Y. A combination of these two types of tables are aligned to fill a given distance D. Using as few tables as possible, find the optimum combination to keep the remaining empty distance is as small as possible. [note: the first priority is to minimize the empty distance, and the second priority is to minimize the number of used tables] X" D Examples: Input: X 3, Y = 5 , D = 24 The optimum combination is: TX = 3, TY = 3, RD = 0 It means: three tables of size X (TX), three tables of size Y (TY), and remaining distance (RD) is 0. 3*3+3 5 = 24 So empty distance = 24 - 24 0 Input: X = 3, Y = 9, D = 29 Output: TX =0, TY = 3, RD = 2 It means: zero tables of size X (TX), three tables of size Y (TY), and remaining distance (RD) is 2. 0* 3+3*9 = 27 So empty distance = 29 - 27 = 2 a) Design an algorithm (pseudocode) to solve the above problem (2 marks), b) Implement your solution using Python (2 marks)

Answer rating: 100% (QA)

Here is the code this is a Dynamic Programming problem x intinputx y intinput... View the full answer