FP Test3 2025 - Revision history

Beh01 at 08:05, 11 November 2025

2025-11-11T08:05:23Z

Beh01 at 07:57, 11 November 2025

2025-11-11T07:57:58Z

Beh01 at 07:53, 11 November 2025

2025-11-11T07:53:24Z

Beh01 at 07:52, 11 November 2025

2025-11-11T07:52:44Z

Beh01 at 07:47, 11 November 2025

2025-11-11T07:47:03Z

Beh01 at 07:45, 11 November 2025

2025-11-11T07:45:27Z

Beh01 at 07:41, 11 November 2025

2025-11-11T07:41:05Z

Beh01 at 07:37, 11 November 2025

2025-11-11T07:37:05Z

Beh01 at 07:33, 11 November 2025

2025-11-11T07:33:15Z

Beh01 at 07:29, 11 November 2025

2025-11-11T07:29:23Z

@@ Line 10: / Line 10: @@
 * a type <code>Stock</code> for the available ingredients (name and quantity),
 * a type <code>Drink</code> with the drink’s name, price, and list of required ingredients,
-* a type Machine that combines both stock and available drinks.
+* a type <code>Machine</code> that combines both stock and available drinks.
 </translate>

@@ Line 129: / Line 129: @@
 <translate>
-* Implement a function <code>bestValue</code> that finds the '''best''' possible subsequence of orders '''maximizing''' the total profit.
+* Implement a function <code>bestValue</code> that finds the best possible combination of orders (any subset of the given list) maximizing the total profit.
-Hint: You can generate all possible order's ''subsequences'', use processPayment to evaluate them and return any such sequence that yields the highest total payment.
+Hint: You can generate all subsets of the input list, evaluate each with <code>processPayment</code>, and return one that yields the highest total payment.
 </translate>

@@ Line 131: / Line 131: @@
 * Implement a function <code>bestValue</code> that finds the '''best''' possible subsequence of orders '''maximizing''' the total profit.
-Hint: You can generate all possible order's 'subsequences', use processPayment to evaluate them and return any such sequence that yields the highest total payment.
+Hint: You can generate all possible order's ''subsequences'', use processPayment to evaluate them and return any such sequence that yields the highest total payment.
 </translate>

@@ Line 7: / Line 7: @@
 <translate>
-Let's have a data types representing the state of a vending machine:
+Let's define a data types representing the state of a vending machine:
 * a type <code>Stock</code> for the available ingredients (name and quantity),
 * a type <code>Drink</code> with the drink’s name, price, and list of required ingredients,
@@ Line 114: / Line 114: @@
 <syntaxhighlight lang="Haskell" class="myDark">
 ghci> processOrders machineExample ["Coffee","Tea","Coffee","Chocolate"]
-Just (Machine {stock = [("water",5),("coffee",2),("milk",1),("tea",2),("sugar",5)], drinks = [ {- skiping list of drinks -} ]})
+Just (Machine {stock = [("water",5),("coffee",2),("milk",1),("tea",2),("sugar",5)], drinks = [ {- skipping list of drinks -} ]})
 </syntaxhighlight>
@@ Line 129: / Line 129: @@
 <translate>
-* Implement a function <code>bestValue</code> that that finds the '''best''' possible subsequence of orders '''maximizing''' the total profit.
+* Implement a function <code>bestValue</code> that finds the '''best''' possible subsequence of orders '''maximizing''' the total profit.
-Hint: You can generate all possible order subsequences, use processPayment to evaluate each sequence and return any sequence that yields the highest total payment.
+Hint: You can generate all possible order's 'subsequences', use processPayment to evaluate them and return any such sequence that yields the highest total payment.
 </translate>

@@ Line 136: / Line 136: @@
 <syntaxhighlight lang="Haskell">bestValue :: Machine -> [String] -> [String]</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">
-ghci> bestValue   machineExample ["Coffee","Tea","Coffee","Chocolate"]
+ghci> bestValue machineExample ["Coffee","Tea","Coffee","Chocolate"]
 ["Coffee","Tea","Coffee","Chocolate"]
-ghci> bestValue   machineExample ["Cappuccino","Cappuccino","Tea","Cocoa","Chocolate"]
+ghci> bestValue machineExample ["Cappuccino","Cappuccino","Tea","Cocoa","Chocolate"]
 ["Cappuccino","Tea","Chocolate"]
-ghci> bestValue   machineExample ["Cocoa","Chocolate"]
+ghci> bestValue machineExample ["Cocoa","Chocolate"]
 ["Cocoa"]
 </syntaxhighlight>

@@ Line 104: / Line 104: @@
 <translate>
-*  Implement a function <code>processOrders</code> that processes a list of orders (drink names) in sequence.
+*  Implement a function <code>processOrders</code> that processes a list of orders (drink names) in sequence. It returns:
-It returns:
+** <code>Just</code> a new machine with the updated stock if all drinks can be served, or
-- <code>Just</code> a new machine with the updated stock if all drinks can be served, or
+** <code>Nothing</code> if any of the orders cannot be fulfilled.
 </translate>
@@ Line 119: / Line 118: @@
 <translate>
-* Implement the function <code>solveMaze</code>. It has 1 argument. It is a list of strings representing a maze row by row from top to bottom ('*' - wall, ' ' - empty square, 's' - starting position, 'e' - ending possition). At the beginning we are at position 's' and we want to get the length of the shortest path to the position denotated by 'e'. Such path compose from steps. in each step we can move one square left, right, up or down. The function returns a number of these steps in the shortest path from 's' to 'e'.</translate>
+* Implement a function <cod>processPayment</code> that processes orders similarly but returns the total price of all successfully served drinks,
-<syntaxhighlight lang="Haskell">solveMaze :: Result -> Int</syntaxhighlight>
+<syntaxhighlight lang="Haskell">processPayment :: Machine -> [String] -> Maybe Int</syntaxhighlight>
 <syntaxhighlight lang="Haskell" class="myDark">
-solveMaze sample4
+ghci> processPayment  machineExample ["Coffee","Tea","Coffee","Chocolate"]
+Just 135
 </syntaxhighlight>