|
2
|
1 module Exercise_2 where |
|
|
2 import Test.QuickCheck |
|
|
3 import Data.List |
|
|
4 |
|
|
5 {---------------------------------------------------------------------} |
|
|
6 {- Aufgabe G2.1 -} |
|
|
7 all_sums :: [Integer] -> [Integer] -> [Integer] |
|
|
8 all_sums xs ys = undefined |
|
|
9 |
|
|
10 |
|
|
11 evens :: [Integer] -> [Integer] |
|
|
12 evens xs = undefined |
|
|
13 |
|
|
14 |
|
|
15 n_lists :: [Integer] -> [[Integer]] |
|
|
16 n_lists xs = undefined |
|
|
17 |
|
|
18 |
|
|
19 all_even_sum_lists :: [Integer] -> [Integer] -> [[Integer]] |
|
|
20 all_even_sum_lists xs ys = undefined |
|
|
21 |
|
|
22 |
|
|
23 |
|
|
24 {---------------------------------------------------------------------} |
|
|
25 {- Aufgabe G2.2 -} |
|
|
26 union :: [Integer] -> [Integer] -> [Integer] |
|
|
27 union xs ys = undefined |
|
|
28 |
|
|
29 |
|
|
30 intersection :: [Integer] -> [Integer] -> [Integer] |
|
|
31 intersection xs ys = undefined |
|
|
32 |
|
|
33 |
|
|
34 diff :: [Integer] -> [Integer] -> [Integer] |
|
|
35 diff xs ys = undefined |
|
|
36 |
|
|
37 |
|
|
38 elem' :: Integer -> [Integer] -> Bool |
|
|
39 elem' x xs = undefined |
|
|
40 |
|
|
41 |
|
|
42 union' :: [Integer] -> [Integer] -> [Integer] |
|
|
43 union' xs ys = undefined |
|
|
44 |
|
|
45 |
|
|
46 {---------------------------------------------------------------------} |
|
|
47 {- Aufgabe G2.3 -} |
|
|
48 eq_frac :: (Integer,Integer) -> (Integer,Integer) -> Bool |
|
|
49 eq_frac (a,b) (c,d) = undefined |
|
|
50 |
|
|
51 |
|
|
52 intersection_frac :: [(Integer,Integer)] -> [(Integer,Integer)] -> [(Integer,Integer)] |
|
|
53 intersection_frac xs ys = undefined |
|
|
54 |
|
|
55 |
|
|
56 |
|
|
57 {---------------------------------------------------------------------} |
|
|
58 {- Aufgabe G2.4 -} |
|
|
59 pow2_slow :: Integer -> Integer |
|
|
60 pow2_slow 0 = 1 |
|
|
61 pow2_slow n | n > 0 = 2 * pow2_slow (n - 1) |
|
|
62 |
|
|
63 |
|
|
64 pow2 :: Integer -> Integer |
|
|
65 pow2 n = undefined |
|
|
66 |
|
|
67 |
|
|
68 |
|
|
69 {---------------------------------------------------------------------} |
|
|
70 {- Aufgabe G2.5 -} |
|
|
71 reachable :: [(Integer, Integer)] -> Integer -> [(Integer, Integer)] |
|
|
72 reachable graph 0 = undefined |
|
|
73 |
|
|
74 |
|
|
75 |
|
|
76 {---------------------------------------------------------------------} |
|
|
77 {- Aufgabe H2.1 -} |
|
|
78 factorials :: [Integer] -> [Integer] |
|
|
79 factorials ns = undefined |
|
|
80 |
|
|
81 count :: [Char] -> Char -> Integer |
|
|
82 count cs c = undefined |
|
|
83 |
|
|
84 |
|
|
85 |
|
|
86 {---------------------------------------------------------------------} |
|
|
87 {- Aufgabe H2.2 -} |
|
|
88 lookupTab :: [Integer] -> [(Integer, [Char])] -> [[[Char]]] |
|
|
89 lookupTab keys tab = undefined |
|
|
90 |
|
|
91 |
|
|
92 |
|
|
93 {---------------------------------------------------------------------} |
|
|
94 {- Aufgabe H2.3 -} |
|
|
95 wordsOfLength :: [Char] -> Integer -> [[Char]] |
|
|
96 wordsOfLength alphabet n = undefined |
|
|
97 |
|
|
98 |
|
|
99 |
|
|
100 {---------------------------------------------------------------------} |
|
|
101 {- Aufgabe H2.4 -} |
|
|
102 {-WETT-} |
|
|
103 perms :: [Char] -> [[Char]] |
|
|
104 perms [] = undefined |
|
|
105 perms xs = undefined |
|
|
106 {-TTEW-} |
