Exercise 11.3.2 Another way is to define an or-gate by a combination of inverters and and gates. Define a function orGate in terms of andGate and inverter. What is the delay time of this function?
The delay parameter has also been left unused in this case. However it would not be difficult to conclude that the delay time for this function would be = inverter delay time + AND delay time + inverter delay time = 2 (inverter delay) + AND delay.
Exercise 11.3.1 Write the implementation of orGate.
Note that the delay parameter in the function afterDelay has not been used since it removes complexity when testing this case.
Exercise 11.2.1 Write a function repeatLoop with also additional syntax for an until clause.
The repeat { command } until (condition) was tricky. The trick is to realize that "until" would be a method call, and for it to be a method call, "repeat {command}" would have to be an object. Since objects are created using new, we could wrap this object creation with a method. The result is below. Note that the second method has been changed to repeatUntilLoop since it would conflict with the previous method repeatUntil.
Exercise 10.3.2 Translate the following for comprehensions to higher-order functions.
Exercise 10.3.1 Define the following function in terms of for.
This will be revisited later.Exercise 9.4.3 Fill in the missing expressions to complete the following definitions of some basic list-manipulation operations as fold operations.
This will be revisited later.Exercise 9.4.2 What would be the difference in asymptotic complexity between the two versions of flatten?
This will be revisited later.Exercise: Define forall and exists in terms of filter.
As before, since class List cannot be extended in scala, the methods are implemented as pure functions taking a list parameter.
Exercise 9.4.1 Consider a function which squares all elements of a list and re- turns a list with the results. Complete the following two equivalent definitions of squareList.
