From fp010@b1.complang.tuwien.ac.at Mon Nov 10 14:53:41 2003 +0100 Date: Mon, 10 Nov 2003 14:53:38 +0100 From: fp153 E185 FP Message-Id: <200311101353.hAADrcM24187@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Testfall: sumSquareRec 0 == 0; Testfall ok Testfall: sumSquareRec 2 == 5; Testfall ok Testfall: sumSquareRec 5 == 55; Testfall ok Punkte fuer diese Funktion: 20 Testfall: sumSquareNRec 0 == 0; Testfall ok Testfall: sumSquareNRec 3 == 14; Testfall ok Testfall: sumSquareNRec 4 == 30; Testfall ok Punkte fuer diese Funktion: 20 Testfall: anzTipps 1 1 == 1; Testfall ok Testfall: anzTipps 3 6 == 20; Testfall ok Testfall: anzTipps 1 7 == 7; Testfall ok Punkte fuer diese Funktion: 20 Testfall: fib 0 == 1; Testfall ok Testfall: fib 5 == 8; Testfall ok Testfall: fib 23 == 46368; Testfall ok Punkte fuer diese Funktion: 20 Testfall: abs(fst( kVA 1) - 4.18667) <= 0.01 && abs(snd( kVA 1) - 12.56) <= 0.01; Testfall ok Testfall: abs(fst( kVA 3.14) - 129.616) <= 0.01 && abs(snd( kVA 3.14) - 123.837) <= 0.01; Testfall ok Punkte gesamt: 80 From fp010@b1.complang.tuwien.ac.at Mon Nov 10 15:01:39 2003 +0100 Return-Path: Date: Mon, 10 Nov 2003 15:01:38 +0100 From: fp153 E185 FP Message-Id: <200311101401.hAAE1c526776@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Punkte fuer diese Funktion: 20 Testfall: sumf (\x->x `div` 3) 7 == 7; Testfall ok Testfall: sumf (\x->x) 0 == 0; Testfall ok Testfall: sumf (\x->x*x) 5 == 55; Testfall ok Testfall: sumf (\x->(-x)*x) 5 == -55; Testfall ok Punkte fuer diese Funktion: 20 Testfall: schaltJahr 2003 == False; Testfall ok Testfall: schaltJahr 2000 == True; Testfall ok Testfall: schaltJahr 2100 == False; Testfall ok Testfall: schaltJahr 1984 == True; Testfall ok Punkte fuer diese Funktion: 20 Testfall: ggt 50 175 == 25; Testfall ok Testfall: ggt 175 175 == 175; Testfall ok Testfall: ggt 17 42 == 1; Testfall ok Testfall: ggt 175 75 == 25; Testfall ok Punkte fuer diese Funktion: 20 Testfall: abs(sqrtApprox 0.0001 1 - 1.0) <= 0.01 ; Testfall ok Testfall: abs(sqrtApprox 0.001 4 - 1.99976) <= 0.01; Testfall ok Testfall: abs(sqrtApprox 0.0001 14 - 3.74167) <= 0.01; Testfall ok Testfall: abs(sqrtApprox 1.5 5 - 2.0) <= 0.01; Testfall ok Testfall: abs(sqrtApprox 0.5 5 - 2.25) <= 0.01; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> False Aufgabe1> [Leaving Hugs] Punkte fuer diese Funktion: 10 Punkte gesamt: 90 From fp010@b1.complang.tuwien.ac.at Thu Nov 13 16:47:58 2003 +0100 Date: Thu, 13 Nov 2003 16:47:57 +0100 From: fp153 E185 FP Message-Id: <200311131547.hADFlvX29143@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Testfall: sumSquareRec 0 == 0; Testfall ok Testfall: ((sumSquareRec 2 == 5) || (sumSquareRec 2 == 1)); Testfall ok Testfall: ((sumSquareRec 5 == 55) || (sumSquareRec 5 == 30)); Testfall ok Punkte fuer diese Funktion: 20 Testfall: sumSquareNRec 0 == 0; Testfall ok Testfall: ((sumSquareNRec 3 == 14) || (sumSquareNRec 3 == 5)); Testfall ok Testfall: ((sumSquareNRec 4 == 30) || (sumSquareNRec 4 == 14)); Testfall ok Punkte fuer diese Funktion: 20 Testfall: anzTipps 1 1 == 1; Testfall ok Testfall: anzTipps 3 6 == 20; Testfall ok Testfall: anzTipps 1 7 == 7; Testfall ok Punkte fuer diese Funktion: 20 Testfall: anzTipps(1,1) == 1; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.hs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : anzTipps (1,1) *** Term : (1,1) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Testfall: anzTipps(3,6) == 20; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.hs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : anzTipps (3,6) *** Term : (3,6) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Testfall: anzTipps(1,7) == 7; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.hs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : anzTipps (1,7) *** Term : (1,7) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Punkte fuer diese Funktion: 0 Testfall: fib 0 == 1; Testfall ok Testfall: fib 5 == 8; Testfall ok Testfall: fib 23 == 46368; Testfall ok Punkte fuer diese Funktion: 20 Testfall: abs(fst( kVA 1) - 4.18667) <= 0.01 && abs(snd( kVA 1) - 12.56) <= 0.01; Testfall ok Testfall: abs(fst( kVA 3.14) - 129.616) <= 0.01 && abs(snd( kVA 3.14) - 123.837) <= 0.01; Testfall ok Testfall: abs(fst( kVA 11) - 5572.45) <= 0.01 && abs(snd( kVA 11) - 1519.76) <= 0.01; Testfall ok Punkte fuer diese Funktion: 20 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Thu Nov 13 16:53:00 2003 +0100 Date: Thu, 13 Nov 2003 16:52:59 +0100 From: fp153 E185 FP Message-Id: <200311131552.hADFqxI31466@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: sumf (\x->x `div` 3) 7 == 7; Testfall ok Testfall: sumf (\x->x) 0 == 0; Testfall ok Testfall: sumf (\x->x*x) 5 == 55; Testfall ok Testfall: sumf (\x->(-x)*x) 5 == -55; Testfall ok Punkte fuer diese Funktion: 25 Testfall: schaltJahr 2003 == False; Testfall ok Testfall: schaltJahr 2000 == True; Testfall ok Testfall: schaltJahr 2100 == False; Testfall ok Testfall: schaltJahr 1984 == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: schaltjahr 2003 == False; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Undefined variable "schaltjahr" Aufgabe1> [Leaving Hugs] Testfall: schaltjahr 2000 == True; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Undefined variable "schaltjahr" Aufgabe1> [Leaving Hugs] Testfall: schaltjahr 2100 == False; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Undefined variable "schaltjahr" Aufgabe1> [Leaving Hugs] Testfall: schaltjahr 1984 == True; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Undefined variable "schaltjahr" Aufgabe1> [Leaving Hugs] Punkte fuer diese Funktion: 0 Testfall: ggt 50 175 == 25; Testfall ok Testfall: ggt 175 175 == 175; Testfall ok Testfall: ggt 17 42 == 1; Testfall ok Testfall: ggt 175 75 == 25; Testfall ok Punkte fuer diese Funktion: 25 Testfall: ggt(50,175) == 25; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : ggt (50,175) *** Term : (50,175) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Testfall: ggt(175,175 == 175; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Syntax error in expression (unexpected end of input) Aufgabe1> [Leaving Hugs] Testfall: ggt(17,42) == 1; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : ggt (17,42) *** Term : (17,42) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Testfall: ggt(175,75) == 25; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe1.lhs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe1.lhs Type :? for help Aufgabe1> ERROR - Type error in application *** Expression : ggt (175,75) *** Term : (175,75) *** Type : (a,b) *** Does not match : Integer Aufgabe1> [Leaving Hugs] Punkte fuer diese Funktion: 0 Testfall: (abs(sqrtApprox 0.0001 1 - 1.0) <= 0.01) || (abs(sqrtApprox 0.0001 1 - sqrt 1) <= 0.00015); Testfall ok Testfall: (abs(sqrtApprox 0.001 4 - 1.99976) <= 0.01) || (abs(sqrtApprox 0.001 4 - sqrt 4) <= 0.0015); Testfall ok Testfall: (abs(sqrtApprox 0.0001 14 - 3.74167) <= 0.01) || (abs(sqrtApprox 0.0001 14 - sqrt 14) <= 0.00015); Testfall ok Testfall: (abs(sqrtApprox 1.5 5 - 2.0) <= 0.01) || (abs(sqrtApprox 1.5 5 - sqrt 5) <= 1.55); Testfall ok Testfall: (abs(sqrtApprox 0.5 5 - 2.25) <= 0.01) || (abs(sqrtApprox 0.5 5 - sqrt 5) <= 0.55); Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Mon Nov 17 14:07:26 2003 +0100 Date: Mon, 17 Nov 2003 14:07:24 +0100 From: fp153 E185 FP Message-Id: <200311171307.hAHD7OM01829@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe2 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: isPowOfTwo 132 == False; Testfall ok Testfall: isPowOfTwo 32 == True; Testfall ok Testfall: isPowOfTwo 1 == True; Testfall ok Testfall: isPowOfTwo 0 == False; Testfall ok Testfall: isPowOfTwo 2 == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: doubleReverse "AbXyZ" == "AbXyZZyXbA"; Testfall ok Testfall: doubleReverse "" == ""; Testfall ok Testfall: doubleReverse " " == " "; Testfall ok Testfall: doubleReverse "Q" == "QQ"; Testfall ok Testfall: doubleReverse "aZ" == "aZZa"; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isPal "a" == True; Testfall ok Testfall: isPal "aBba" == False; Testfall ok Testfall: isPal "otto" == True; Testfall ok Testfall: isPal "" == True; Testfall ok Testfall: isPal "aBcdeEdCba" == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: (fibFix 0 == 0) || (fibFix 0 == 1) ; Testfall ok Testfall: (fibFix 2 == 1) || (fibFix 2 == 2); Testfall ok Testfall: (fibFix 7 == 13) || (fibFix 7 == 21); Testfall ok Testfall: (fibFix 11 == 89) || (fibFix 11 == 144); Testfall ok Testfall: (fibFix 13 == 233) || (fibFix 13 == 377); Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Fri Nov 21 17:07:51 2003 +0100 Date: Fri, 21 Nov 2003 17:07:50 +0100 From: fp153 E185 FP Message-Id: <200311211607.hALG7oc14741@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe3 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: isPrime 42 == False; Testfall ok Testfall: isPrime 19 == True; Testfall ok Testfall: isPrime 2 == True; Testfall ok Testfall: isPrime 1 == False; Testfall ok Testfall: isPrime 63 == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: listPrime 2 14 == [2,3,5,7,11,13]; Testfall ok Testfall: listPrime 1 20 == [2,3,5,7,11,13,17,19]; Testfall ok Testfall: listPrime 23 23 == [23]; Testfall ok Testfall: listPrime 24 24 == []; Testfall ok Testfall: listPrime 32 36 == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: primFaktorZerlegung 376712 == [(2,3),(7,2),(31,2)]; Testfall ok Testfall: primFaktorZerlegung 1351075 == [(5,2),(11,1),(17,3)]; Testfall ok Testfall: primFaktorZerlegung 62985 == [(3,1),(5,1),(13,1),(17,1),(19,1)]; Testfall ok Testfall: primFaktorZerlegung 2 == [(2,1)]; Testfall ok Testfall: primFaktorZerlegung 23 == [(23,1)]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: kgv 15 25 == 75; Testfall ok Testfall: kgv 27 54 == 54; Testfall ok Testfall: kgv 19 19 == 19; Testfall ok Testfall: kgv 62985 1 == 62985; Testfall ok Testfall: kgv 2 33 == 66; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Fri Nov 21 18:06:07 2003 +0100 Date: Fri, 21 Nov 2003 18:06:06 +0100 From: fp153 E185 FP Message-Id: <200311211706.hALH66A29801@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe3 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: isPrime 42 == False; Testfall ok Testfall: isPrime 19 == True; Testfall ok Testfall: isPrime 2 == True; Testfall ok Testfall: isPrime 1 == False; Testfall ok Testfall: isPrime 63 == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: listPrime 2 14 == [2,3,5,7,11,13]; Testfall ok Testfall: listPrime 1 20 == [2,3,5,7,11,13,17,19]; Testfall ok Testfall: listPrime 23 23 == [23]; Testfall ok Testfall: listPrime 24 24 == []; Testfall ok Testfall: listPrime 32 36 == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: primFaktorZerlegung 1351075 == [(5,2),(11,1),(17,3)]; Testfall ok Testfall: primFaktorZerlegung 62985 == [(3,1),(5,1),(13,1),(17,1),(19,1)]; Testfall ok Testfall: primFaktorZerlegung 2 == [(2,1)]; Testfall ok Testfall: primFaktorZerlegung 23 == [(23,1)]; Testfall ok Testfall: primFaktorZerlegung 47089 == [(7,2),(31,2)]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: kgv 15 25 == 75; Testfall ok Testfall: kgv 27 54 == 54; Testfall ok Testfall: kgv 19 19 == 19; Testfall ok Testfall: kgv 62985 1 == 62985; Testfall ok Testfall: kgv 2 33 == 66; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Fri Nov 21 18:39:34 2003 +0100 Date: Fri, 21 Nov 2003 18:39:33 +0100 From: fp153 E185 FP Message-Id: <200311211739.hALHdXo13309@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe2 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: isPowOfTwo 132 == False; Testfall ok Testfall: isPowOfTwo 32 == True; Testfall ok Testfall: isPowOfTwo 1 == True; Testfall ok Testfall: isPowOfTwo 0 == False; Testfall ok Testfall: isPowOfTwo 2 == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: doubleReverse "AbXyZ" == "AbXyZZyXbA"; Testfall ok Testfall: doubleReverse "" == ""; Testfall ok Testfall: doubleReverse " " == " "; Testfall ok Testfall: doubleReverse "Q" == "QQ"; Testfall ok Testfall: doubleReverse "aZ" == "aZZa"; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isPal "a" == True; Testfall ok Testfall: isPal "aBba" == False; Testfall ok Testfall: isPal "otto" == True; Testfall ok Testfall: isPal "" == True; Testfall ok Testfall: isPal "aBcdeEdCba" == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: (fibFix 0 == 0) || (fibFix 0 == 1) ; Testfall ok Testfall: (fibFix 2 == 1) || (fibFix 2 == 2); Testfall ok Testfall: (fibFix 7 == 13) || (fibFix 7 == 21); Testfall ok Testfall: (fibFix 11 == 89) || (fibFix 11 == 144); Testfall ok Testfall: (fibFix 13 == 233) || (fibFix 13 == 377); Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Fri Nov 21 19:34:46 2003 +0100 Date: Fri, 21 Nov 2003 19:34:45 +0100 From: fp153 E185 FP Message-Id: <200311211834.hALIYjb23158@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Testfall: sumSquareRec 0 == 0; Testfall ok Testfall: ((sumSquareRec 2 == 5) || (sumSquareRec 2 == 1)); Testfall ok Testfall: ((sumSquareRec 5 == 55) || (sumSquareRec 5 == 30)); Testfall ok Punkte fuer diese Funktion: 20 Testfall: sumSquareNRec 0 == 0; Testfall ok Testfall: ((sumSquareNRec 3 == 14) || (sumSquareNRec 3 == 5)); Testfall ok Testfall: ((sumSquareNRec 4 == 30) || (sumSquareNRec 4 == 14)); Testfall ok Punkte fuer diese Funktion: 20 Testfall: anzTipps 1 1 == 1; Testfall ok Testfall: anzTipps 3 6 == 20; Testfall ok Testfall: anzTipps 1 7 == 7; Testfall ok Punkte fuer diese Funktion: 20 Testfall: fib 0 == 1; Testfall ok Testfall: fib 5 == 8; Testfall ok Testfall: fib 23 == 46368; Testfall ok Punkte fuer diese Funktion: 20 Testfall: abs(fst( kVA 1) - 4.18667) <= 0.01 && abs(snd( kVA 1) - 12.56) <= 0.01; Testfall ok Testfall: abs(fst( kVA 3.14) - 129.616) <= 0.01 && abs(snd( kVA 3.14) - 123.837) <= 0.01; Testfall ok Testfall: abs(fst( kVA 11) - 5572.45) <= 0.01 && abs(snd( kVA 11) - 1519.76) <= 0.01; Testfall ok Punkte fuer diese Funktion: 20 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Fri Nov 21 19:37:29 2003 +0100 Date: Fri, 21 Nov 2003 19:37:28 +0100 From: fp153 E185 FP Message-Id: <200311211837.hALIbS525444@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe1 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: sumf (\x->x `div` 3) 7 == 7; Testfall ok Testfall: sumf (\x->x) 0 == 0; Testfall ok Testfall: sumf (\x->x*x) 5 == 55; Testfall ok Testfall: sumf (\x->(-x)*x) 5 == -55; Testfall ok Punkte fuer diese Funktion: 25 Testfall: schaltJahr 2003 == False; Testfall ok Testfall: schaltJahr 2000 == True; Testfall ok Testfall: schaltJahr 2100 == False; Testfall ok Testfall: schaltJahr 1984 == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: ggt 50 175 == 25; Testfall ok Testfall: ggt 175 175 == 175; Testfall ok Testfall: ggt 17 42 == 1; Testfall ok Testfall: ggt 175 75 == 25; Testfall ok Punkte fuer diese Funktion: 25 Testfall: (abs(sqrtApprox 0.0001 1 - 1.0) <= 0.01) || (abs(sqrtApprox 0.0001 1 - sqrt 1) <= 0.00015); Testfall ok Testfall: (abs(sqrtApprox 0.001 4 - 1.99976) <= 0.01) || (abs(sqrtApprox 0.001 4 - sqrt 4) <= 0.0015); Testfall ok Testfall: (abs(sqrtApprox 0.0001 14 - 3.74167) <= 0.01) || (abs(sqrtApprox 0.0001 14 - sqrt 14) <= 0.00015); Testfall ok Testfall: (abs(sqrtApprox 1.5 5 - 2.0) <= 0.01) || (abs(sqrtApprox 1.5 5 - sqrt 5) <= 1.55); Testfall ok Testfall: (abs(sqrtApprox 0.5 5 - 2.25) <= 0.01) || (abs(sqrtApprox 0.5 5 - sqrt 5) <= 0.55); Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Thu Nov 27 14:08:48 2003 +0100 Date: Thu, 27 Nov 2003 14:08:47 +0100 From: fp153 E185 FP Message-Id: <200311271308.hARD8lA15781@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe4 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: compr "aayYYyyqyyyoH" == [(2,'a'),(1,'y'),(2,'Y'),(2,'y'),(1,'q'),(3,'y'),(1,'o'),(1,'H')]; Testfall ok Testfall: compr "" == []; Testfall ok Testfall: uncompr [(3,'B'),(1,'r'),(4,'K'),(1,'b'),(2,'B'),(3,'Z')] == "BBBrKKKKbBBZZZ"; Testfall ok Testfall: uncompr [] == ""; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sums [2,6,-2,0,-3,7,8,9,10,11] == [11,21,30,38,45,42,42,40,46,48]; Testfall ok Testfall: sums [17,-4] == [-4,13]; Testfall ok Testfall: sums [-42] == [-42]; Testfall ok Testfall: sums [] == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sumBoth [] [3,5,21,-5,17,0,0,0,5,3,3,17] == 41; Testfall ok Testfall: sumBoth [-4,1,1,-2,0,-2,5] [] == 0; Testfall ok Testfall: sumBoth [1,2,3] [3,2,1] == 0; Testfall ok Testfall: sumBoth [121,-2,31,121,31] [-31,121,15,27,15,15] == 40; Testfall ok Punkte fuer diese Funktion: 25 Testfall: anzSigmaSymbole "TTrRrDDF&&kKK&*kkKK" == [ [('k',3),('r',2)], [('D',2),('F',1),('K',4),('R',1),('T',2)], [] ]; Testfall ok Testfall: anzSigmaSymbole "**@#nn!!njnnjj@@llpm" == [ [('j',3),('l',2),('m',1),('n',5),('p',1)], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "" == [ [], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "bbObb--%oo&&YYyyoOOOJbbjey@!" == [ [('b',6),('e',1),('j',1),('o',3),('y',3)], [('J',1),('O',4),('Y',2)], [('E',1),('O',7)] ]; Testfall ok Punkte gesamt: 75 From fp010@b1.complang.tuwien.ac.at Thu Nov 27 17:20:15 2003 +0100 Date: Thu, 27 Nov 2003 17:20:14 +0100 From: fp153 E185 FP Message-Id: <200311271620.hARGKEM29663@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe3 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: isPrime 42 == False; Testfall ok Testfall: isPrime 19 == True; Testfall ok Testfall: isPrime 2 == True; Testfall ok Testfall: isPrime 1 == False; Testfall ok Testfall: isPrime 63 == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: listPrime 2 14 == [2,3,5,7,11,13]; Testfall ok Testfall: listPrime 1 20 == [2,3,5,7,11,13,17,19]; Testfall ok Testfall: listPrime 23 23 == [23]; Testfall ok Testfall: listPrime 24 24 == []; Testfall ok Testfall: listPrime 32 36 == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: primFaktorZerlegung 4675 == [(5,2),(11,1),(17,1)]; Testfall ok Testfall: primFaktorZerlegung 12597 == [(3,1),(13,1),(17,1),(19,1)]; Testfall ok Testfall: primFaktorZerlegung 2 == [(2,1)]; Testfall ok Testfall: primFaktorZerlegung 23 == [(23,1)]; Testfall ok Testfall: primFaktorZerlegung 6727 == [(7,1),(31,2)]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: kgv 15 25 == 75; Testfall ok Testfall: kgv 27 54 == 54; Testfall ok Testfall: kgv 19 19 == 19; Testfall ok Testfall: kgv 62985 1 == 62985; Testfall ok Testfall: kgv 2 33 == 66; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Thu Nov 27 17:31:15 2003 +0100 Date: Thu, 27 Nov 2003 17:31:14 +0100 From: fp153 E185 FP Message-Id: <200311271631.hARGVE309697@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe4 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: compr "aayYYyyqyyyoH" == [(2,'a'),(1,'y'),(2,'Y'),(2,'y'),(1,'q'),(3,'y'),(1,'o'),(1,'H')]; Testfall ok Testfall: compr "" == []; Testfall ok Testfall: uncompr [(3,'B'),(1,'r'),(4,'K'),(1,'b'),(2,'B'),(3,'Z')] == "BBBrKKKKbBBZZZ"; Testfall ok Testfall: uncompr [] == ""; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sums [2,6,-2,0,-3,7,8,9,10,11] == [11,21,30,38,45,42,42,40,46,48]; Testfall ok Testfall: sums [17,-4] == [-4,13]; Testfall ok Testfall: sums [-42] == [-42]; Testfall ok Testfall: sums [] == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sumBoth [] [3,5,21,-5,17,0,0,0,5,3,3,17] == 41; Testfall ok Testfall: sumBoth [-4,1,1,-2,0,-2,5] [] == 0; Testfall ok Testfall: sumBoth [1,2,3] [3,2,1] == 0; Testfall ok Testfall: sumBoth [121,-2,31,121,31] [-31,121,15,27,15,15] == 40; Testfall ok Punkte fuer diese Funktion: 25 Testfall: anzSigmaSymbole "TTrRrDDF&&kKK&*kkKK" == [ [('k',3),('r',2)], [('D',2),('F',1),('K',4),('R',1),('T',2)], [] ]; Testfall ok Testfall: anzSigmaSymbole "**@#nn!!njnnjj@@llpm" == [ [('j',3),('l',2),('m',1),('n',5),('p',1)], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "" == [ [], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "bbObb--%oo&&YYyyoOOOJbbjey@!" == [ [('b',6),('e',1),('j',1),('o',3),('y',3)], [('J',1),('O',4),('Y',2)], [('E',1),('O',7)] ]; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sat Dec 6 09:37:42 2003 +0100 Date: Sat, 6 Dec 2003 09:37:33 +0100 From: fp153 E185 FP Message-Id: <200312060837.hB68bXU15854@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe4 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: compr "aayYYyyqyyyoH" == [(2,'a'),(1,'y'),(2,'Y'),(2,'y'),(1,'q'),(3,'y'),(1,'o'),(1,'H')]; Testfall ok Testfall: compr "" == []; Testfall ok Testfall: uncompr [(3,'B'),(1,'r'),(4,'K'),(1,'b'),(2,'B'),(3,'Z')] == "BBBrKKKKbBBZZZ"; Testfall ok Testfall: uncompr [] == ""; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sums [2,6,-2,0,-3,7,8,9,10,11] == [11,21,30,38,45,42,42,40,46,48]; Testfall ok Testfall: sums [17,-4] == [-4,13]; Testfall ok Testfall: sums [-42] == [-42]; Testfall ok Testfall: sums [] == []; Testfall ok Punkte fuer diese Funktion: 25 Testfall: sumBoth [] [3,5,21,-5,17,0,0,0,5,3,3,17] == 41; Testfall ok Testfall: sumBoth [-4,1,1,-2,0,-2,5] [] == 0; Testfall ok Testfall: sumBoth [1,2,3] [3,2,1] == 0; Testfall ok Testfall: sumBoth [121,-2,31,121,31] [-31,121,15,27,15,15] == 40; Testfall ok Punkte fuer diese Funktion: 25 Testfall: anzSigmaSymbole "TTrRrDDF&&kKK&*kkKK" == [ [('k',3),('r',2)], [('D',2),('F',1),('K',4),('R',1),('T',2)], [] ]; Testfall ok Testfall: anzSigmaSymbole "**@#nn!!njnnjj@@llpm" == [ [('j',3),('l',2),('m',1),('n',5),('p',1)], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "" == [ [], [], [] ]; Testfall ok Testfall: anzSigmaSymbole "bbObb--%oo&&YYyyoOOOJbbjey@!" == [ [('b',6),('e',1),('j',1),('o',3),('y',3)], [('J',1),('O',4),('Y',2)], [('E',1),('O',7)] ]; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sat Dec 6 11:21:40 2003 +0100 Date: Sat, 6 Dec 2003 11:21:39 +0100 From: fp153 E185 FP Message-Id: <200312061021.hB6ALdB17609@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe5 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: addComp 42 [[1,2,3],[],[4,5],[6]] == [[42,1,2,3],[42],[42,4,5],[42,6]]; Testfall ok Testfall: addComp "abc" [["cd","def"],[],["ckkpe"]] == [["abc","cd","def"],["abc"],["abc","ckkpe"]]; Testfall ok Testfall: addComp [45,12] [[[]], [[456,676],[],[468]],[[345]]] == [[[45,12],[]], [[45,12],[456,676],[],[468]],[[45,12],[345]]] ; Testfall ok Testfall: addComp (4,'a') [[], [(3,'c'),(45,'f')], [(78,'z')]] == [[(4,'a')], [(4,'a'),(3,'c'),(45,'f')], [(4,'a'),(78,'z')]] ; Testfall ok Testfall: addComp [(3.1,"abc"),(5.3,"")] [[[(3.1,"abc"),(5.3,"")],[]],[[],[]]] == [[[(3.1,"abc"),(5.3,"")],[(3.1,"abc"),(5.3,"")],[]],[[(3.1,"abc"),(5.3,"")],[],[]]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isElem 17 (delete 42 (delete 17 (insert 17 []))) == False; Testfall ok Testfall: isElem 5 (delete 5 (insert 5 (insert 5 [4,3,5,1,6]))) == False; Testfall ok Testfall: isElem 3 (insert 3 (delete 3 [])) == True; Testfall ok Testfall: isElem 4711.0 (delete 3.14 (insert 2.15 (delete 5.27 (insert 4711.0 [])))) == True; Testfall ok Testfall: isElem 6.67 (insert 6.67 (delete 6.67 (insert 6.67 [4.3,6.67,3.17]))) == True; Testfall ok Testfall: isElem 3.3 (insert 3.3 (delete 3.3 [4.3516,3.3,4.56])) == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isSetElem [5,76,12] [[5,76,77],[],[76,5]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,77],[],[12,76,5]] == True; Testfall ok Testfall: isSetElem [] [[5,76,77],[],[12,76,5]] == True; Testfall ok Testfall: isSetElem [] [[5.78,76.89,77.12],[12.13,76.6,5.0]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,77],[],[12,76,5,15]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,12,77,38],[],[5,76]] == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isSetElem [] (powerSet []) == True; Testfall ok Testfall: isSetElem [] (powerSet [4.5]) == True && isSetElem [4.5] (powerSet [4.5]) == True; Testfall ok Testfall: isSetElem [] (powerSet [5.6,4.3]) == True; Testfall ok Testfall: isSetElem [4.3] (powerSet [42.34,5.6,4.3,6.9]) == True; Testfall ok Testfall: isSetElem [42.34,5.6,4.36,6.9] (powerSet [42.34,5.6,4.36]) == False; Testfall ok Testfall: isSetElem [5.6,42.34,4.36] (powerSet [42.34,5.6,4.36,9.27]) == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Mon Dec 15 20:24:51 2003 +0100 Date: Mon, 15 Dec 2003 20:24:50 +0100 From: fp153 E185 FP Message-Id: <200312151924.hBFJOo829598@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe5 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: addComp 42 [[1,2,3],[],[4,5],[6]] == [[42,1,2,3],[42],[42,4,5],[42,6]]; Testfall ok Testfall: addComp "abc" [["cd","def"],[],["ckkpe"]] == [["abc","cd","def"],["abc"],["abc","ckkpe"]]; Testfall ok Testfall: addComp [45,12] [[[]], [[456,676],[],[468]],[[345]]] == [[[45,12],[]], [[45,12],[456,676],[],[468]],[[45,12],[345]]] ; Testfall ok Testfall: addComp (4,'a') [[], [(3,'c'),(45,'f')], [(78,'z')]] == [[(4,'a')], [(4,'a'),(3,'c'),(45,'f')], [(4,'a'),(78,'z')]] ; Testfall ok Testfall: addComp [(3.1,"abc"),(5.3,"")] [[[(3.1,"abc"),(5.3,"")],[]],[[],[]]] == [[[(3.1,"abc"),(5.3,"")],[(3.1,"abc"),(5.3,"")],[]],[[(3.1,"abc"),(5.3,"")],[],[]]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isElem 17 (delete 42 (delete 17 (insert 17 []))) == False; Testfall ok Testfall: isElem 5 (delete 5 (insert 5 (insert 5 [4,3,5,1,6]))) == False; Testfall ok Testfall: isElem 3 (insert 3 (delete 3 [])) == True; Testfall ok Testfall: isElem 4711.0 (delete 3.14 (insert 2.15 (delete 5.27 (insert 4711.0 [])))) == True; Testfall ok Testfall: isElem 6.67 (insert 6.67 (delete 6.67 (insert 6.67 [4.3,6.67,3.17]))) == True; Testfall ok Testfall: isElem 3.3 (insert 3.3 (delete 3.3 [4.3516,3.3,4.56])) == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isSetElem [5,76,12] [[5,76,77],[],[76,5]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,77],[],[12,76,5]] == True; Testfall ok Testfall: isSetElem [] [[5,76,77],[],[12,76,5]] == True; Testfall ok Testfall: isSetElem [] [[5.78,76.89,77.12],[12.13,76.6,5.0]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,77],[],[12,76,5,15]] == False; Testfall ok Testfall: isSetElem [5,76,12] [[5,76,12,77,38],[],[5,76]] == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isSetElem [] (powerSet []) == True; Testfall ok Testfall: isSetElem [] (powerSet [4.5]) == True && isSetElem [4.5] (powerSet [4.5]) == True; Testfall ok Testfall: isSetElem [] (powerSet [5.6,4.3]) == True; Testfall ok Testfall: isSetElem [4.3] (powerSet [42.34,5.6,4.3,6.9]) == True; Testfall ok Testfall: isSetElem [42.34,5.6,4.36,6.9] (powerSet [42.34,5.6,4.36]) == False; Testfall ok Testfall: isSetElem [5.6,42.34,4.36] (powerSet [42.34,5.6,4.36,9.27]) == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Mon Dec 15 22:35:48 2003 +0100 Date: Mon, 15 Dec 2003 22:35:46 +0100 From: fp153 E185 FP Message-Id: <200312152135.hBFLZkV22090@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe6 Punkte pro Funktion: 110; Abzug pro fehlerhaften Testfall: 10 Testfall: tiefe Empty == 0; Testfall ok Testfall: tiefe (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node (\x->17+x) Empty Empty) == 1; Testfall ok Testfall: tiefe (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == 3; Testfall ok Testfall: istVollstaendig Empty == True; Testfall ok Testfall: istVollstaendig (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == False ; Testfall ok Testfall: istVollstaendig (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istVollstaendig (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istBalanciert Empty == True; Testfall ok Testfall: istBalanciert (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istBalanciert (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == True; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> False Aufgabe6> [Leaving Hugs] Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istPerfektBalanciert Empty == True; Testfall ok Testfall: istPerfektBalanciert (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) (Empty)) == True; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> ERROR - Syntax error in expression (unexpected end of input) Aufgabe6> [Leaving Hugs] Testfall: istPerfektBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istPerfektBalanciert (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == True; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> False Aufgabe6> [Leaving Hugs] Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == False; Testfall ok Testfall: praeOrder Empty == []; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> ERROR - Unresolved overloading *** Type : Eq a => Bool *** Expression : praeOrder Empty == [] Aufgabe6> [Leaving Hugs] Testfall: praeOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [37,15,12,83,12]; Testfall ok Testfall: praeOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: praeOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['a','T','Z','b']; Testfall ok Testfall: praeOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [1.0,2.5,3.2,0.0,6.2]; Testfall ok Testfall: inOrder Empty == []; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> ERROR - Unresolved overloading *** Type : Eq a => Bool *** Expression : inOrder Empty == [] Aufgabe6> [Leaving Hugs] Testfall: inOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [15,12,37,12,83]; Testfall ok Testfall: inOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: inOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','a','b','Z']; Testfall ok Testfall: inOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,1.0,0.0,3.2,6.2]; Testfall ok Testfall: postOrder Empty == []; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> ERROR - Unresolved overloading *** Type : Eq a => Bool *** Expression : postOrder Empty == [] Aufgabe6> [Leaving Hugs] Testfall: postOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [12,15,12,83,37]; Testfall ok Testfall: postOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: postOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','b','Z','a']; Testfall ok Testfall: postOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,0.0,6.2,3.2,1.0]; Testfall ok Testfall: protokoll (Node "Frohe " (Node "!" Empty Empty) (Node "Weihnachten" Empty Empty)) == "Frohe Weihnachten!"; Testfall falsch. Ausgabe: __ __ __ __ ____ ___ _________________________________________ || || || || || || ||__ Hugs 98: Based on the Haskell 98 standard ||___|| ||__|| ||__|| __|| Copyright (c) 1994-2002 ||---|| ___|| World Wide Web: http://haskell.org/hugs || || Report bugs to: hugs-bugs@haskell.org || || Version: November 2002 _________________________________________ Haskell 98 mode: Restart with command line option -98 to enable extensions Reading file "/usr/local/lib/hugs/lib/Prelude.hs": Parsing       Dependency analysis                   Type checking             Compiling         Reading file "Aufgabe6.hs": Parsing       Dependency analysis                   Type checking             Compiling          Hugs session for: /usr/local/lib/hugs/lib/Prelude.hs Aufgabe6.hs Type :? for help Aufgabe6> False Aufgabe6> [Leaving Hugs] Punkte fuer diese Funktion: 40 Punkte fuer diese Funktion: 110 Punkte fuer diese Funktion: 110 Punkte gesamt: 260 From fp010@b1.complang.tuwien.ac.at Sun Dec 21 18:48:09 2003 +0100 Date: Sun, 21 Dec 2003 18:48:08 +0100 From: fp153 E185 FP Message-Id: <200312211748.hBLHm8K32251@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe6 Punkte pro Funktion: 100; Abzug pro fehlerhaften Testfall: 10 Testfall: tiefe Empty == 0; Testfall ok Testfall: tiefe (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node (\x->17+x) Empty Empty) == 1; Testfall ok Testfall: tiefe (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == 3; Testfall ok Testfall: istVollstaendig (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == False ; Testfall ok Testfall: istVollstaendig (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istVollstaendig (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istBalanciert (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istPerfektBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == False; Testfall ok Testfall: praeOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [37,15,12,83,12]; Testfall ok Testfall: praeOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: praeOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['a','T','Z','b']; Testfall ok Testfall: praeOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [1.0,2.5,3.2,0.0,6.2]; Testfall ok Testfall: inOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [15,12,37,12,83]; Testfall ok Testfall: inOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: inOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','a','b','Z']; Testfall ok Testfall: inOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,1.0,0.0,3.2,6.2]; Testfall ok Testfall: postOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [12,15,12,83,37]; Testfall ok Testfall: postOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: postOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','b','Z','a']; Testfall ok Testfall: postOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,0.0,6.2,3.2,1.0]; Testfall ok Punkte fuer diese Funktion: 100 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sun Dec 21 18:50:58 2003 +0100 Date: Sun, 21 Dec 2003 18:50:57 +0100 From: fp153 E185 FP Message-Id: <200312211750.hBLHovT02206@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe6 Punkte pro Funktion: 100; Abzug pro fehlerhaften Testfall: 10 Testfall: tiefe Empty == 0; Testfall ok Testfall: tiefe (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node (\x->17+x) Empty Empty) == 1; Testfall ok Testfall: tiefe (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == 5; Testfall ok Testfall: tiefe (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == 3; Testfall ok Testfall: tiefe (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == 3; Testfall ok Testfall: istVollstaendig (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == False ; Testfall ok Testfall: istVollstaendig (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istVollstaendig (Node 'a' Empty (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istVollstaendig (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istBalanciert (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == True; Testfall ok Testfall: istBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == True; Testfall ok Testfall: istPerfektBalanciert (Node (\x->17+x) Empty Empty) == True; Testfall ok Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty (Node 'Y' (Node 'c' Empty Empty) Empty)) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == False; Testfall ok Testfall: istPerfektBalanciert (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == False; Testfall ok Testfall: praeOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [37,15,12,83,12]; Testfall ok Testfall: praeOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: praeOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['a','T','Z','b']; Testfall ok Testfall: praeOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [1.0,2.5,3.2,0.0,6.2]; Testfall ok Testfall: inOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [15,12,37,12,83]; Testfall ok Testfall: inOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: inOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','a','b','Z']; Testfall ok Testfall: inOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,1.0,0.0,3.2,6.2]; Testfall ok Testfall: postOrder (Node 37 (Node 15 Empty (Node 12 Empty Empty)) (Node 83 (Node 12 Empty Empty) Empty)) == [12,15,12,83,37]; Testfall ok Testfall: postOrder (Node True Empty Empty) == [True]; Testfall ok Testfall: postOrder (Node 'a' (Node 'T' Empty Empty) (Node 'Z' (Node 'b' Empty Empty) Empty)) == ['T','b','Z','a']; Testfall ok Testfall: postOrder (Node 1.0 (Node 2.5 Empty Empty) (Node 3.2 (Node 0.0 Empty Empty) (Node 6.2 Empty Empty))) == [2.5,0.0,6.2,3.2,1.0]; Testfall ok Punkte fuer diese Funktion: 100 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sat Jan 10 22:34:41 2004 +0100 Date: Sat, 10 Jan 2004 22:34:40 +0100 From: fp153 E185 FP Message-Id: <200401102134.i0ALYeX22927@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe7 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: reachable 5 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 2 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 1 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,3,4]; Testfall ok Testfall: reachable 3 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [3]; Testfall ok Testfall: reachable 1 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 4 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [4,5]; Testfall ok Testfall: reachable 5 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [5]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isCyclic [(1,[1,3]),(2,[1,5]),(3,[]),(4,[4,2]),(5,[2])] == True; Testfall ok Testfall: isCyclic [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == False; Testfall ok Testfall: isCyclic [(1,[2,5]),(2,[3]),(3,[4]),(4,[2,3]),(5,[])] == True; Testfall ok Testfall: isCyclic [(1,[2]),(2,[3,5]),(3,[4,1]),(4,[2]),(5,[3])] == True; Testfall ok Testfall: isConnected [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == False; Testfall ok Testfall: isConnected [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == False; Testfall ok Testfall: isConnected [(1,[2,3]),(2,[3,1]),(3,[1,2])] == True; Testfall ok Testfall: isConnected [(1,[2,5]),(2,[3]),(3,[4]),(4,[2,3]),(5,[])] == False; Testfall ok Testfall: isConnected [(1,[2]),(2,[3,5]),(3,[4,1]),(4,[2]),(5,[3])] == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: leaves (Leave 42) == [42]; Testfall ok Testfall: leaves (INode 21 (Leave 17) (Leave 4)) == [17,4]; Testfall ok Testfall: leaves (INode 42 (Leave 2) (INode 3 (Leave 17) (Leave 4))) == [2,17,4]; Testfall ok Testfall: nodesOnLevel 2 (Leave 42) == [] ; Testfall ok Testfall: nodesOnLevel 1 (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) == [12,3]; Testfall ok Testfall: nodesOnLevel 0 (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) == [42]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: similar (Leave 42) (INode 21 (Leave 17) (Leave 4)) == False; Testfall ok Testfall: similar (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) (Leave 13) == False; Testfall ok Testfall: similar (INode 21 (Leave 17) (Leave 4)) (INode 21 (Leave 17) (Leave 4)) == True; Testfall ok Testfall: similar (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) (INode 15 (INode 12 (Leave 13) (Leave 21)) (INode 3 (Leave 217) (Leave 24))) == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sat Jan 10 22:35:23 2004 +0100 Date: Sat, 10 Jan 2004 22:35:22 +0100 From: fp153 E185 FP Message-Id: <200401102135.i0ALZMm24731@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe8 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: listMan (*2) [[2],[2,4,3,5],[],[34,5]] == [[4],[4,8,6,10],[],[68,10]]; Testfall ok Testfall: listMan (1+) [[2],[2,4,3,5],[],[34,5]] == [[3],[3,5,4,6],[],[35,6]]; Testfall ok Testfall: listMan (negate) [[2],[2,4,3,5],[],[34,5]] == [[-2],[-2,-4,-3,-5],[],[-34,-5]]; Testfall ok Testfall: listMan mOne [["abcde","de"],["XYz"],[],["rTcE","ZBN"]] == [["edcba","ed"],["zYX"],[],["EcTr","NBZ"]] ; Testfall ok Testfall: listMan mTwo [[25434,45622],[24,35],[],[56]] == [[43452,22654],[42,53],[],[65]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: matTransp [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]; Testfall ok Testfall: matTransp [[1,4],[2,5],[3,6]] == [[1,2,3],[4,5,6]]; Testfall ok Testfall: matTransp [[1,2,3,4]] == [[1],[2],[3],[4]]; Testfall ok Testfall: matTransp [[1],[2],[3],[4]] == [[1,2,3,4]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: matGRA (+) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[2,4,6],[8,10,12]]; Testfall ok Testfall: matGRA (-) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[0,0,0],[0,0,0]]; Testfall ok Testfall: matGRA (*) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[1,4,9],[16,25,36]]; Testfall ok Testfall: matGRA (div) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[1,1,1],[1,1,1]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: skalProd [2,4,5] [3,4,2] == 32; Testfall ok Testfall: skalProd [2,4,5] [1,1,1] == 11; Testfall ok Testfall: skalProd [0,4,5] [3,0,2] == 10; Testfall ok Testfall: matMult [[2,-3,5],[1,2,0]] [[1,-3],[5,0],[2,4]] == [[-3,14],[11,-3]]; Testfall ok Testfall: matMult [[1,2,3],[4,5,6]] [[1,4],[2,5],[3,6]] == [[14,32],[32,77]]; Testfall ok Testfall: matMult [[1,2],[3,4]] [[5,6],[7,8]] == [[19,22],[43,50]]; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sun Jan 18 20:37:07 2004 +0100 Date: Sun, 18 Jan 2004 20:37:06 +0100 From: fp153 E185 FP Message-Id: <200401181937.i0IJb6I29430@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe7 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: reachable 5 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 2 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 1 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [1,3,4]; Testfall ok Testfall: reachable 3 [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == [3]; Testfall ok Testfall: reachable 1 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [1,2,3,4,5]; Testfall ok Testfall: reachable 4 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [4,5]; Testfall ok Testfall: reachable 5 [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == [5]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isCyclic [(1,[1,3]),(2,[1,5]),(3,[]),(4,[4,2]),(5,[2])] == True; Testfall ok Testfall: isCyclic [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == False; Testfall ok Testfall: isCyclic [(1,[2,5]),(2,[3]),(3,[4]),(4,[2,3]),(5,[])] == True; Testfall ok Testfall: isCyclic [(1,[2]),(2,[3,5]),(3,[4,1]),(4,[2]),(5,[3])] == True; Testfall ok Testfall: isConnected [(1,[1,3,4]),(2,[1,5]),(3,[]),(4,[4]),(5,[2])] == False; Testfall ok Testfall: isConnected [(1,[2,3]),(2,[3,4]),(3,[4,5]),(4,[5]),(5,[])] == False; Testfall ok Testfall: isConnected [(1,[2,3]),(2,[3,1]),(3,[1,2])] == True; Testfall ok Testfall: isConnected [(1,[2,5]),(2,[3]),(3,[4]),(4,[2,3]),(5,[])] == False; Testfall ok Testfall: isConnected [(1,[2]),(2,[3,5]),(3,[4,1]),(4,[2]),(5,[3])] == True; Testfall ok Punkte fuer diese Funktion: 25 Testfall: leaves (Leave 42) == [42]; Testfall ok Testfall: leaves (INode 21 (Leave 17) (Leave 4)) == [17,4]; Testfall ok Testfall: leaves (INode 42 (Leave 2) (INode 3 (Leave 17) (Leave 4))) == [2,17,4]; Testfall ok Testfall: nodesOnLevel 2 (Leave 42) == [] ; Testfall ok Testfall: nodesOnLevel 1 (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) == [12,3]; Testfall ok Testfall: nodesOnLevel 0 (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) == [42]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: similar (Leave 42) (INode 21 (Leave 17) (Leave 4)) == False; Testfall ok Testfall: similar (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) (Leave 13) == False; Testfall ok Testfall: similar (INode 21 (Leave 17) (Leave 4)) (INode 21 (Leave 17) (Leave 4)) == True; Testfall ok Testfall: similar (INode 42 (INode 12 (Leave 1) (Leave 2)) (INode 3 (Leave 17) (Leave 4))) (INode 15 (INode 12 (Leave 13) (Leave 21)) (INode 3 (Leave 217) (Leave 24))) == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Sun Jan 18 20:37:58 2004 +0100 Date: Sun, 18 Jan 2004 20:37:57 +0100 From: fp153 E185 FP Message-Id: <200401181937.i0IJbvW31447@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe8 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: listMan (*2) [[2],[2,4,3,5],[],[34,5]] == [[4],[4,8,6,10],[],[68,10]]; Testfall ok Testfall: listMan (1+) [[2],[2,4,3,5],[],[34,5]] == [[3],[3,5,4,6],[],[35,6]]; Testfall ok Testfall: listMan (negate) [[2],[2,4,3,5],[],[34,5]] == [[-2],[-2,-4,-3,-5],[],[-34,-5]]; Testfall ok Testfall: listMan mOne [["abcde","de"],["XYz"],[],["rTcE","ZBN"]] == [["edcba","ed"],["zYX"],[],["EcTr","NBZ"]] ; Testfall ok Testfall: listMan mTwo [[25434,45622],[24,35],[],[56]] == [[43452,22654],[42,53],[],[65]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: matTransp [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]; Testfall ok Testfall: matTransp [[1,4],[2,5],[3,6]] == [[1,2,3],[4,5,6]]; Testfall ok Testfall: matTransp [[1,2,3,4]] == [[1],[2],[3],[4]]; Testfall ok Testfall: matTransp [[1],[2],[3],[4]] == [[1,2,3,4]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: matGRA (+) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[2,4,6],[8,10,12]]; Testfall ok Testfall: matGRA (-) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[0,0,0],[0,0,0]]; Testfall ok Testfall: matGRA (*) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[1,4,9],[16,25,36]]; Testfall ok Testfall: matGRA (div) [[1,2,3],[4,5,6]] [[1,2,3],[4,5,6]] == [[1,1,1],[1,1,1]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: skalProd [2,4,5] [3,4,2] == 32; Testfall ok Testfall: skalProd [2,4,5] [1,1,1] == 11; Testfall ok Testfall: skalProd [0,4,5] [3,0,2] == 10; Testfall ok Testfall: matMult [[2,-3,5],[1,2,0]] [[1,-3],[5,0],[2,4]] == [[-3,14],[11,-3]]; Testfall ok Testfall: matMult [[1,2,3],[4,5,6]] [[1,4],[2,5],[3,6]] == [[14,32],[32,77]]; Testfall ok Testfall: matMult [[1,2],[3,4]] [[5,6],[7,8]] == [[19,22],[43,50]]; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Mon Jan 19 14:28:37 2004 +0100 Date: Mon, 19 Jan 2004 14:28:36 +0100 From: fp153 E185 FP Message-Id: <200401191328.i0JDSan06148@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe9 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: listFilt (>3) [[2],[2,4,3,5],[],[34,5]] == [[],[4,5],[],[34,5]]; Testfall ok Testfall: listFilt (<=3) [[2],[2,4,3,5],[],[34,5]] == [[2],[2,3],[],[]]; Testfall ok Testfall: listFilt (/=3) [[2],[2,4,3,5],[],[34,5]] == [[2],[2,4,5],[],[34,5]]; Testfall ok Testfall: listFilt fOne [["abc","de"],["XYz"],[],["rTcE","ZBN"]] == [["de"],[],[],["rTcE"]]; Testfall ok Testfall: listFilt fOne [["Abc","de"],["xsYz"],[],["rTsstcE","zZBN"]] == [["de"],["xsYz"],[],["zZBN"]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: listFilt fTwo [[1,2,55,17,3],[24,35],[],[56,13,15,55]] == [[1,2,55,3],[],[],[13,55]]; Testfall ok Testfall: listFilt fTwo [[7,0,3,1,78],[13,13],[0,1,1,2],[]] == [[0,3,1],[13,13],[0,1,1,2],[]]; Testfall ok Testfall: listFilt fThree [["otto","Otto","P"],[],["lotto"]] == [["otto","P"],[],[]]; Testfall ok Testfall: listFilt fThree [["AttAttA","OttoottO","PPPP"],[""," "]] == [["AttAttA","OttoottO","PPPP"],[""," "]]; Testfall ok Testfall: extractSet [2,2,2] == [2]; Testfall ok Testfall: (extractSet [2,1,2,1,2,2] == [2,1]) || (extractSet [2,1,2,1,2,2] == [1,2]); Testfall ok Punkte fuer diese Funktion: 25 Testfall: isEqual (extractSet [2,4,3,5,4,1,3,2,1]) [4,1,3,2,5] == True; Testfall ok Testfall: isEqual (extractSet [2,2,2]) [2] == True; Testfall ok Testfall: isEqual (extractSet [2,3,2,2,3]) [2] == False; Testfall ok Testfall: isSet [2,4,3,5,4,1,3,2,1] == False; Testfall ok Testfall: isSet [2,4,3,5,1] == True; Testfall ok Testfall: isElem 42 [2,4,3,5,1] == False; Testfall ok Testfall: isElem 3 [] == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isElem 5 [2,4,3,5,1] == True; Testfall ok Testfall: isEqual (union [2,4,3,5,1] [2,4,6,3,5,1]) [2,4,6,3,5,1] == True; Testfall ok Testfall: isEqual (union [2,4,3,5,1] []) [4,2,5,1,3] == True; Testfall ok Testfall: isEqual (inters [3,1,6,4] [6,3,7]) [3,6] == True; Testfall ok Testfall: isEqual (inters [] [6.3,7]) [] == True; Testfall ok Testfall: isEqual (diff [3,1,6,4] [2,3,7]) [1,6,4] == True; Testfall ok Testfall: isEqual (diff [3,1,6,4] []) [1,3,4,6] == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Mon Jan 26 18:04:48 2004 +0100 Date: Mon, 26 Jan 2004 17:52:10 +0100 From: fp153 E185 FP Message-Id: <200401261652.i0QGqAZ30097@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe9 Punkte pro Funktion: 25; Abzug pro fehlerhaften Testfall: 10 Testfall: listFilt (>3) [[2],[2,4,3,5],[],[34,5]] == [[],[4,5],[],[34,5]]; Testfall ok Testfall: listFilt (<=3) [[2],[2,4,3,5],[],[34,5]] == [[2],[2,3],[],[]]; Testfall ok Testfall: listFilt (/=3) [[2],[2,4,3,5],[],[34,5]] == [[2],[2,4,5],[],[34,5]]; Testfall ok Testfall: listFilt fOne [["abc","de"],["XYz"],[],["rTcE","ZBN"]] == [["de"],[],[],["rTcE"]]; Testfall ok Testfall: listFilt fOne [["Abc","de"],["xsYz"],[],["rTsstcE","zZBN"]] == [["de"],["xsYz"],[],["zZBN"]]; Testfall ok Punkte fuer diese Funktion: 25 Testfall: listFilt fTwo [[1,2,55,17,3],[24,35],[],[56,13,15,55]] == [[1,2,55,3],[],[],[13,55]]; Testfall ok Testfall: listFilt fTwo [[7,0,3,1,78],[13,13],[0,1,1,2],[]] == [[0,3,1],[13,13],[0,1,1,2],[]]; Testfall ok Testfall: listFilt fThree [["otto","Otto","P"],[],["lotto"]] == [["otto","P"],[],[]]; Testfall ok Testfall: listFilt fThree [["AttAttA","OttoottO","PPPP"],[""," "]] == [["AttAttA","OttoottO","PPPP"],[""," "]]; Testfall ok Testfall: extractSet [2,2,2] == [2]; Testfall ok Testfall: (extractSet [2,1,2,1,2,2] == [2,1]) || (extractSet [2,1,2,1,2,2] == [1,2]); Testfall ok Punkte fuer diese Funktion: 25 Testfall: isEqual (extractSet [2,4,3,5,4,1,3,2,1]) [4,1,3,2,5] == True; Testfall ok Testfall: isEqual (extractSet [2,2,2]) [2] == True; Testfall ok Testfall: isEqual (extractSet [2,3,2,2,3]) [2] == False; Testfall ok Testfall: isSet [2,4,3,5,4,1,3,2,1] == False; Testfall ok Testfall: isSet [2,4,3,5,1] == True; Testfall ok Testfall: isElem 42 [2,4,3,5,1] == False; Testfall ok Testfall: isElem 3 [] == False; Testfall ok Punkte fuer diese Funktion: 25 Testfall: isElem 5 [2,4,3,5,1] == True; Testfall ok Testfall: isEqual (union [2,4,3,5,1] [2,4,6,3,5,1]) [2,4,6,3,5,1] == True; Testfall ok Testfall: isEqual (union [2,4,3,5,1] []) [4,2,5,1,3] == True; Testfall ok Testfall: isEqual (inters [3,1,6,4] [6,3,7]) [3,6] == True; Testfall ok Testfall: isEqual (inters [] [6.3,7]) [] == True; Testfall ok Testfall: isEqual (diff [3,1,6,4] [2,3,7]) [1,6,4] == True; Testfall ok Testfall: isEqual (diff [3,1,6,4] []) [1,3,4,6] == True; Testfall ok Punkte fuer diese Funktion: 25 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Tue Jan 27 18:14:02 2004 +0100 Date: Tue, 27 Jan 2004 18:14:00 +0100 From: fp153 E185 FP Message-Id: <200401271714.i0RHE0q13443@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe10 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Testeingabe: do {z<-inOut reverse; print z} end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "end"; putStrLn "0"} Testfall ok Testeingabe: do {z<-inOut reverse; print z} abc def xyz end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "abc"; putStrLn "cba"; putStrLn "def"; putStrLn "fed"; putStrLn "xyz"; putStrLn "zyx"; putStrLn "end"; putStrLn "3"} Testfall ok Punkte fuer diese Funktion: 20 Testfall: tokenize "" == []; Testfall ok Testfall: tokenize "*" == [Mult]; Testfall ok Testfall: tokenize "+" == [Add]; Testfall ok Testfall: tokenize "42" == [Value 42]; Testfall ok Testfall: tokenize "!" == [Fak]; Testfall ok Testfall: tokenize "^" == [Pot]; Testfall ok Testfall: tokenize "-12" == [Value (-12)]; Testfall ok Testfall: tokenize "%" == [Invalid]; Testfall ok Testfall: tokenize " " == []; Testfall ok Testfall: tokenize "+*123 !^456. -789" == [Add,Mult,Value 123,Fak,Pot,Value 456,Invalid,Value (-789)]; Testfall ok Punkte fuer diese Funktion: 20 Testfall: toString [] == "Error"; Testfall ok Testfall: toString [42] == "42"; Testfall ok Testfall: toString [1,-2,35] == "35 -2 1"; Testfall ok Punkte fuer diese Funktion: 20 Testfall: interpret [] == []; Testfall ok Testfall: interpret [Value 5] == [5]; Testfall ok Testfall: interpret [Value 5, Value 8] == [8,5]; Testfall ok Testfall: interpret [Value 5, Value 8, Mult] == [40]; Testfall ok Testfall: interpret [Value 2, Value 3, Pot] == [9]; Testfall ok Testfall: interpret [Value 2, Value 5, Fak] == [120,2]; Testfall ok Testfall: interpret [Value 5, Value 8, Add] == [13]; Testfall ok Testfall: interpret [Add] == []; Testfall ok Testfall: interpret [Value (-5), Add] == [-5]; Testfall ok Testfall: interpret [Value (-126), Fak, Add] == [-1]; Testfall ok Testfall: interpret [Value 4, Fak, Add] == [24]; Testfall ok Testfall: interpret [Value 50, Add, Value 8] == [50]; Testfall ok Testfall: interpret [Value 2,Value 3,Fak,Pot,Value 7] == [7,36]; Testfall ok Testfall: interpret [Value 1,Value 2,Add,Value 3,Mult,Value 4] == [4,9]; Testfall ok Punkte fuer diese Funktion: 20 Testeingabe: main end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "end"; putStrLn "0 Zeilen bearbeitet"} Testfall ok Testeingabe: main 1 2 + 3 4 * 8 5 6 + 7 * 9 end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "1 2 +"; putStrLn "3"; putStrLn "3 4 *"; putStrLn "12"; putStrLn "8 5 6 + 7 * 9"; putStrLn "8 77 9"; putStrLn "end"; putStrLn "3 Zeilen bearbeitet"} Testfall ok Testeingabe: main 3 3 ^ end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "3 3 ^"; putStrLn "27"; putStrLn "end"; putStrLn "1 Zeilen bearbeitet"} Testfall ok Punkte fuer diese Funktion: 20 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Wed Jan 28 14:28:21 2004 +0100 Date: Wed, 28 Jan 2004 14:28:17 +0100 From: fp153 E185 FP Message-Id: <200401281328.i0SDSHU28599@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Ergebnis_Aufgabe10 Punkte pro Funktion: 20; Abzug pro fehlerhaften Testfall: 10 Testeingabe: do {z<-inOut reverse; print z} end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "end"; putStrLn "0"} Testfall ok Testeingabe: do {z<-inOut reverse; print z} abc def xyz end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "abc"; putStrLn "cba"; putStrLn "def"; putStrLn "fed"; putStrLn "xyz"; putStrLn "zyx"; putStrLn "end"; putStrLn "3"} Testfall ok Punkte fuer diese Funktion: 20 Testfall: tokenize "" == []; Testfall ok Testfall: tokenize "*" == [Mult]; Testfall ok Testfall: tokenize "+" == [Add]; Testfall ok Testfall: tokenize "42" == [Value 42]; Testfall ok Testfall: tokenize "!" == [Fak]; Testfall ok Testfall: tokenize "^" == [Pot]; Testfall ok Testfall: tokenize "-12" == [Value (-12)]; Testfall ok Testfall: tokenize "%" == [Invalid]; Testfall ok Testfall: tokenize " " == []; Testfall ok Testfall: tokenize "+*123 !^456. -789" == [Add,Mult,Value 123,Fak,Pot,Value 456,Invalid,Value (-789)]; Testfall ok Punkte fuer diese Funktion: 20 Testfall: toString [] == "Error"; Testfall ok Testfall: toString [42] == "42"; Testfall ok Testfall: toString [1,-2,35] == "35 -2 1"; Testfall ok Punkte fuer diese Funktion: 20 Testfall: interpret [] == []; Testfall ok Testfall: interpret [Value 5] == [5]; Testfall ok Testfall: interpret [Value 5, Value 8] == [8,5]; Testfall ok Testfall: interpret [Value 5, Value 8, Mult] == [40]; Testfall ok Testfall: interpret [Value 2, Value 3, Pot] == [9]; Testfall ok Testfall: interpret [Value 2, Value 5, Fak] == [120,2]; Testfall ok Testfall: interpret [Value 5, Value 8, Add] == [13]; Testfall ok Testfall: interpret [Add] == []; Testfall ok Testfall: interpret [Value (-5), Add] == [-5]; Testfall ok Testfall: interpret [Value (-126), Fak, Add] == [-1]; Testfall ok Testfall: interpret [Value 4, Fak, Add] == [24]; Testfall ok Testfall: interpret [Value 50, Add, Value 8] == [50]; Testfall ok Testfall: interpret [Value 2,Value 3,Fak,Pot,Value 7] == [7,36]; Testfall ok Testfall: interpret [Value 1,Value 2,Add,Value 3,Mult,Value 4] == [4,9]; Testfall ok Punkte fuer diese Funktion: 20 Testeingabe: main end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "end"; putStrLn "0 Zeilen bearbeitet"} Testfall ok Testeingabe: main 1 2 + 3 4 * 8 5 6 + 7 * 9 end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "1 2 +"; putStrLn "3"; putStrLn "3 4 *"; putStrLn "12"; putStrLn "8 5 6 + 7 * 9"; putStrLn "8 77 9"; putStrLn "end"; putStrLn "3 Zeilen bearbeitet"} Testfall ok Testeingabe: main 3 3 ^ end Referenzeingabe (sollte die gleiche Ausgabe haben wie die Testeingabe): do {putStrLn "3 3 ^"; putStrLn "27"; putStrLn "end"; putStrLn "1 Zeilen bearbeitet"} Testfall ok Punkte fuer diese Funktion: 20 Punkte gesamt: 100 From fp010@b1.complang.tuwien.ac.at Thu Jan 29 14:59:33 2004 +0100 Date: Thu, 29 Jan 2004 14:59:31 +0100 From: fp153 E185 FP Message-Id: <200401291359.i0TDxVU16858@b1.complang.tuwien.ac.at> To: fp010@b1.complang.tuwien.ac.at Subject: Zwischenstand 1. 2. Beispiel Abgabe Abgabe Durchschnitt Aufgabe0 100.0 100.0 100.0 Aufgabe1 100.0 100.0 100.0 Aufgabe2 100.0 100.0 100.0 Aufgabe3 100.0 100.0 100.0 Aufgabe4 100.0 100.0 100.0 Aufgabe5 100.0 100.0 100.0 Aufgabe6 100.0 100.0 100.0 Aufgabe7 100.0 100.0 100.0 Aufgabe8 100.0 100.0 100.0 Aufgabe9 100.0 100.0 100.0 Aufgabe10 100.0 100.0 100.0 Gesamt 1100.0