 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2016/functional-programming-design-and-analysis-of-algorithms-resit/1/d/solution

For finite lists and

n \geq 0

, the answers are

reverse (xs ++ ys) = reverse ys ++ reverse xs
length (drop n xs) = max 0 (length xs - n)

The maximum is necessary when the count exceeds the list length.

 New to topics? Read the docs here!