last tutorium

klausur/code/haskell/kl.hs

@@ -10,7 +10,8 @@ levenshtein xs [] = length xs
 levenshtein (x:xs) (y:ys)
     | x == y = levenshtein xs ys
     | otherwise = 1 + minim
-        [ levenshtein (x:xs) ys -- y einfuegen
-        , levenshtein xs (y:ys) -- x loeschen
-        , levenshtein xs ys-- x zu y aendern
+        [
+            levenshtein (x:xs) ys
+            , levenshtein xs (y:ys)
+            , levenshtein xs ys
         ]
\ No newline at end of file

klausur_tut/20_03_2013.pl

+% Knowledge Base
+busFahrt(linie4, 1420, drieschergaesschen, 1424, karlsgraben).
+busFahrt(linie33, 1411, ponttor, 1413, drieschergaesschen).
+
+% Befehle:
+% busVerbindung(ponttor, karlsgraben, 1400, P).
+% busVerbindung(ponttor, karlsgraben, 1415, P).
+
+
+% Aufgabe
+busVerbindung(O, O, _, []).
+busVerbindung(V, B, S, [mit(L, VZ, BO)|R]) :- busFahrt(L, VZ, V, BZ, BO),
+                            VZ >= B,
+                            busVerbindung(BO, B, BZ, R).
\ No newline at end of file

klausur_tut/21_03_2012.pl

+% Aufruf:
+% del(2,[3,2,1,2,3],ZS).
+% delN(s(s(0)),[1,2,3],ZS).
+% min([3,2,1,2,3],Y).
+
+% a
+del(_, [], []).
+del(X, [X|XS], XS).
+del(X, [Y|XS], [Y|R]) :- del(X, XS, R).
+
+% b
+delN(0, XS, XS).
+delN(s(X), XS, R) :- del(_, XS, YS), delN(X, YS, R).
+
+% c
+min([X], X).
+min([X|XS], X) :- min(XS, Y), Y >= X.
+min([X|XS], Y) :- min(XS, Y), Y < X.
\ No newline at end of file

klausur_tut/22_02_2012.pl

+% Aufruf
+% kennzeichen([auto(eu-ts884,69),auto(dn-gh184,64),auto(ac-lj123,72)],X).
+% einordnen([auto(ac-mb815,66),auto(bm-co100,74)],[auto(eu-ts884,69),auto(dn-gh184,64),auto(ac-lj123,72)],X).
+%
+
+% a
+kennzeichen([], []).
+kennzeichen([auto(X, _) | XS], [X| R]) :- kennzeichen(XS, R).
+
+% b
+einordnen(XS, [], XS).
+einordnen([], YS, YS).
+einordnen([X|XS], [Y|YS], [X, Y|R]) :- einordnen(XS, YS, R).
+
+% c
+durchschnitt([auto(_, G)], 1, G).
+durchschnitt([auto(_, G) | XS], N, D) :- durchschnitt(XS, N1, D1), N is N1 + 1, D is (D1 * N1 + G) / N.
\ No newline at end of file