5893
Comment:
|
12173
|
Deletions are marked like this. | Additions are marked like this. |
Line 3: | Line 3: |
= Exercise Sheet 1 = [[attachment:SearchEnginesWS0910/ExerciseSheet1/lecture-1.pdf|Here is a PDF of the slides of Lecture 1]]. |
Here are PDFs of the slides of the lectures so far: [[attachment:SearchEnginesWS0910/lecture-1.pdf|Lecture 1]], [[attachment:SearchEnginesWS0910/lecture-2.pdf|Lecture 2]], [[attachment:SearchEnginesWS0910/lecture-3.pdf|Lecture 3]], [[attachment:SearchEnginesWS0910/lecture-4.pdf|Lecture 4]], [[attachment:SearchEnginesWS0910/lecture-5.pdf|Lecture 5]], [[attachment:SearchEnginesWS0910/lecture-6.pdf|Lecture 6]], [[attachment:SearchEnginesWS0910/lecture-7.pdf|Lecture 7]], [[attachment:SearchEnginesWS0910/lecture-8.pdf|Lecture 8]]. |
Line 6: | Line 5: |
[[attachment:SearchEnginesWS0910/ExerciseSheet1/exercise-1.pdf|Here is a PDF of Exercise Sheet 1]]. | Here are .lpd files of the recordings of the lectures so far (except Lecture 2, where we had problems with the microphone): [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-1.lpd|Recording Lecture 1]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-3.lpd|Recording Lecture 3]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-4.lpd|Recording Lecture 4]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-5.lpd|Recording Lecture 5 (no audio)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-6.lpd|Recording Lecture 6 (with audio for a change)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-7.avi|Recording Lecture 7 (AVI)]], [[http://vulcano.informatik.uni-freiburg.de/lecturnity/lecture-8.avi|Recording Lecture 8 (AVI)]]. |
Line 8: | Line 7: |
[[SearchEnginesWS0910/StudentIntros|Introduce yourself on this page please (Exercise 1)]]. | Here are PDFs of the exercise sheets so far: [[attachment:SearchEnginesWS0910/exercise-1.pdf|Exercise Sheet 1]], [[attachment:SearchEnginesWS0910/exercise-2.pdf|Exercise Sheet 2]], [[attachment:SearchEnginesWS0910/exercise-3.pdf|Exercise Sheet 3]], [[attachment:SearchEnginesWS0910/exercise-4.pdf|Exercise Sheet 4]], [[attachment:SearchEnginesWS0910/exercise-5.pdf|Exercise Sheet 5]], [[attachment:SearchEnginesWS0910/exercise-6.pdf|Exercise Sheet 6]], [[attachment:SearchEnginesWS0910/exercise-7.pdf|Exercise Sheet 7]], [[attachment:SearchEnginesWS0910/exercise-8.pdf|Exercise Sheet 8]]. |
Line 10: | Line 9: |
[[SearchEnginesWS0910/ExerciseSheet1|Upload your results to Exercise Sheet 1 on this page please]]. | Here are your solutions and comments on the previous exercise sheets: [[SearchEnginesWS0910/ExerciseSheet1|Solutions and Comments 1]], [[SearchEnginesWS0910/ExerciseSheet2|Solutions and Comments 2]], [[SearchEnginesWS0910/ExerciseSheet3|Solutions and Comments 3]], [[SearchEnginesWS0910/ExerciseSheet4|Solutions and Comments 4]], [[SearchEnginesWS0910/ExerciseSheet5|Solutions and Comments 5]], [[SearchEnginesWS0910/ExerciseSheet6|Solutions and Comments 6]], [[SearchEnginesWS0910/ExerciseSheet7|Solutions and Comments 7]]. = Exercise Sheet 8 = The recordings of all lectures are now available, see above. Lecture 2 is missing because we had technical problems there. To play the Lecturnity recordings (.lpd files) you need the [[http://www.lecturnity.de/de/download/lecturnity-player|Lecturnity Player, which you can download here]]. I put the Camtasia recordings as .avi files, which you can play with any ordinary video player; I would recommend [[http://www.videolan.org/vlc|VLC]]. [[SearchEnginesWS0910/Rules|Here are the rules for the exercises as explained in Lecture 2]]. [[SearchEnginesWS0910/ExerciseSheet8|Here you can upload your solutions for Exercise Sheet 8]]. |
Line 14: | Line 21: |
To Johann + all: I am sorry but solving the exercises is mandatory'', however attending the tutorials is not, i.e. if you understand everything there is no need for you to come to the tutorials. '''Marjan 26Oct 1:45pm''' | ''Here is Hint 2:'' It is not evident in the first case in Hint 1 below that S' ' ' is a monotone sequence. It looks monotone, since by induction hypothesis, S' ' is monotone and then we obtain S' ' ' by adding another transformation at the end. But note that the definition of monotone asks for *strict* monotonicity as far as insert and replace operations are concerned. This can me remedied by proving a slightly stronger statement, namely that for given x and y, there does not only exist a monotone sequence with length ED(x, y), but a monotone sequence with the additional property that all insert / replace operations occur at positions <= m, and all delete operations occur at positions << m+1. '''Hannah 14Dec09 22:46''' |
Line 16: | Line 23: |
'''Notice:''' Please note that I recommend using English when producing your handouts. Please use German if you are absolutely not confident with English. In fact, either language is fine - it's just that there is a chance that I don't understand everything (if it's written in German). Thanks! '''Marjan 26Oct 1:41pm''' | Ok, here are two hints for Exercise 3. ''Hint 1:'' Let S be a sequence of transformation that transforms x into y. We have to show that there is a *monotone* sequence that transforms x into y and that is of the same length as S. For the induction step, differentiate between three cases, as in the proof of Lemma 2 in the lecture. Let's take as the first case that the last character of y is obtained by an insert or a replace operation of S. Remove that transformation from S, and, if it was an insert and not the last operation from S, decrease the positions of the subsequent transformation in S by one. Call the resulting sequence of transformations S'. Obviously S' is one shorter than S. Verify that S' transforms x into y', where y' is y without its last character. By the induction hypothesis, there now exists a *monotone* sequence S' ' which transforms x into y'. Append the insert / replace operation which we removed from S to S' ' (so that it indeed inserts / replaces the last character of y). Then S' ' ' transforms x into y and has the same length as S. The other two cases are that the last character of x is removed by a delete operation at some point, and that both the last character of x and the last character of y are untouched by any of the transformations in S. ''[Hint 2 will be added soon]'' '''Hannah 14Dec09 22:10''' |
Line 18: | Line 25: |
Hi there, i don't know if i missed something but i also asked a fellow student who did not know! Are the Exercises mandatory and do we get some kind of points for them (where we need a specific amount to be allowed to participate the exam). I am asking because i don't know if i can finish all of the assigned tasks till tonight. '''Johann 26Oct09 1:39pm''' | Hi all, I am on the train right now, I just finished writing a quite elaborate hint (using Thunderbird), but now it seems, Thunderbird has swallowed that mail draft. I'll try to find it again, and if not, have to write it again. I hate Thunderbird, I am having so many troubles with it. '''Hannah 14Dec09 22:03''' |
Line 20: | Line 27: |
Hi Claudius + all: it's up to you how many you compute, the more you can find the better. The obvious algorithm is of course to try out all pairs of words. This will find all pairs with one hit, but it's obviously a quadratic algorithm and so will take a very long time even for a relatively small collection. See if you can find a smarter algorithm. Be assured, there is one. '''Hannah 26Oct09 1:26pm''' | To Johannes + All: Here is a hint from my side: Using the induction as the professor pointed out, one should proof that for any sequence of transformations of string x to string y, there exist a corresponding monotone sequence of transformations with the same length. '''Marjan 14Dec 20:00''' |
Line 22: | Line 29: |
Hi! In Exercise 4: Do we have to compute all possible pairs of query-words with one hit or only one pair of words? '''Claudius 26Oct09 12:50am''' | Most humbly I ask for further hints for exercise 3. '''Johannes 14Dec09 19:53''' |
Line 24: | Line 31: |
To Björn: No, it does not. You do not need to include positional information in your inverted index. But you're right: indexes are usually positional and the Zipf's law refers to the size of the inverted lists when positions are included. '''Marjan 25Oct 7:45pm''' | Supplemental to Manuela + all: According to an (old) study, most of the words do not contain duplicate k-grams. '''Marjan 14Dec09 19:35''' |
Line 26: | Line 33: |
Thank you for the response. Does this also concern the inverted index? I'm wondering because the slides only contain examples where the list of documents does not contain duplicate entries. Personally, I could imagine a practical use for both variants. That's why i'm asking. Thanks again in advance. '''Björn 25Oct09 7:20pm''' | Hi Manuela + all: thanks for pointing out this problem. No, you don't have to consider this. You may either assume that the k-grams of each word are distinct, or consider A and B as multi-sets, that is, in case a k-gram occurs x > 1 times in a word it is counted x times in the set of k-grams for that word as well. In either case, the size of the set of k-grams of a word x is exactly |x| - k + 1. If that does not fully answer your question, please ask again. '''Hannah 14Dec09 19:20''' |
Line 28: | Line 35: |
Hi Björn + all: occurrence always means individual occurrence, that is, if a collection has two documents and the word x occurs once in the first document and twice in the second document then there are three occurrences of this word overall. Ok? '''Hannah 25Oct09 2:12pm''' | I've got a problem with my formula for exercise 2. If I have the words x = bord and y = booo and I want to get the two-grams A = {bo,or,rd} and B = {bo,oo}, then in B there will be a two-gram "oo" lost, because of the set. My formula doesn't realize that and I don't know if I could fix it. Must we consider this problem? '''Manuela 14Dec09 18:58''' |
Line 30: | Line 37: |
To Zhongjie + all: you are right, you can't add the #acl line to the document yourself, so I just did it for you. I will change the instructions on the upload page accordingly. Sorry for this initial confusion, but hey, good that we have a Wiki. '''Hannah 25Oct09 2:06pm''' | To all again: if you want to get notification when someone added a comment to this page, just click on the Info / Subscribe link towards the top right. Then this Wiki page effectively becomes a mailing list for you. If you make only a trivial change to the page (like correcting a typo), then tick the box "Trivial change" before saving, then people will not be sent a notification for (almost) nothing. '''Hannah 14Dec09 14:49''' |
Line 32: | Line 39: |
Hey everyone! Whenever the exercise is talking about frequencies and occurences. Does it talk about occurences in different documents or should we considre multiple occurences in the same document. Thanks a lot. '''Björn 25Oct09 12:49pm''' | To all: Exercise 3 is certainly the hardest on this sheet. Although again nobody has asked for a hint so far, here is one: You have to prove that ED(x, y) = EDm(x, y), where ED is the normal edit distance, and EDm is the edit distance where the sequence of transformations must be monotone, as defined in the lecture and on the sheet. ED(x, y) <= EDm(x, y) is trivial since every monotone transformation sequence is also a normal transformation sequence. To prove EDm(x, y) <= ED(x, y), the natural way is again to use induction over |x| + |y|, as done in the lecture for my proof of Lemma 2 (which didn't quite work out, but for other reasons). If you need more hints, ask. '''Hannah 14Dec09 14:46''' |
Line 34: | Line 41: |
To Johannes: How did you solve the problem? I have logged in my account as my name, and my email links only this account. But I still get the error message 'You can't change ACLs on this page since you have no admin rights on it! ' when I try to enter '#acl ZhongjieCai:read,write -All:read ' to the first line of the page... '''Zhongjie 25Oct09 01:15am''' | Hi Björn, I don't understand why/how you would need that a transformation "knows" its position. I also don't see that there is any big formalism involved in what a transformation is. A transformation is one of insert / delete / replace, and it occurs at a particular position of the current string. That is a transformation, no more no less. '''Hannah 14Dec09 14:42''' |
Line 36: | Line 43: |
Problem solved. To everybody: don't try to create multiple users with the same e-mail address. '''Johannes 25Oct09 00:21am''' | One question on exercise 3: Do we have to assume that each transformation is of a certain form (i.e. insert at i'th character of current word, where it matters how many deletes/inserts have been done previously)? Or can we assume that a transformation somehow "knows" its position? If we have to deal with it in an abstract way, should we create our own way of describing a transformation or is there a formalism we all should use. '''Björn 13:31''' |
Line 38: | Line 45: |
Oh, I see, well that *must* be your user name. Sorry for not making that clear earlier. Please create an account with that user name and try again. '''Hannah 25Oct09 00:02am''' | Here is another bonus point system: http://www.informatik.uni-freiburg.de:8081/swt/teaching/winter-term-2009/informatik-iii-theoretische-informatik. Additionally I would like to add that most of these bonus point systems have exercises which are far less work. '''Björn''' |
Line 40: | Line 47: |
No that is not my user name. '''Johannes 24Oct09 11:58pm''' | In some other lectures the points from the sheets are used to increase the grade from the exam. If one got 50% then she/he got 0.3 grade better, 80% for 0.6 better, but min. 4.0 in exam. I.e. 83% of the exercise points and 2.3 in exam = 1.7 final grade. Data Mining & Machine Learning used a more complex scheme, there was theoretical sheets and practical sheets using Weka (the slides should be on electures server). '''Markus 14Dec09 9:23''' |
Line 42: | Line 50: |
Hi Johannes, if you are logged in as JohannesStork you should be able to see it, did you try that? '''Hannah 24Oct09 11:59pm''' | Many exercise sheets contained two tasks and for each task we could get 1 point. That means that we could got 2 or even 3 points per sheet. The exercises were optional, but because of the bonus points most students did the exercises. There was another reason to do the exercises. In this lecture the exam was very similar to the exercise sheet tasks, so we had two considerable advantages. In two other lectures we had to achieve 30 and 50% of the exercise points to participate at the exam. '''Manuela 14Dec09 00:57''' |
Line 44: | Line 52: |
I don't know if this is the right place to ask, but I can't access my exercise page. It says "Sie dürfen diese Seite nicht ansehen." '''Johannes 24Oct09 11:50pm''' | Now that I think about it, there were points for solving exercises in exercise-class. Also, there were more than 15 points achievable over the semester, but max. 15 were credited in the exam. '''alex 13Dec09 23:57''' |
Line 46: | Line 54: |
Good question, Johannes. Please upload the source code separately, either as a .zip or .tgz archive. I have modified the instructions on the upload page accordingly. Sorry if that means additional work for you, we weren't expecting anybody to submit so early ... '''Hannah 24Oct09 11:43pm''' | In that lecture we could reach max. 15 bonus points for the exercises. Each exercise sheet scored one point + one extra point for specially good/clever solutions. I don't think there was a constraint on admission to the exam. There might have been points for solving exercises in the exercise-class, but I'm not sure about that. (--> already one year ago) '''alex 13Dec09 23:48''' |
Line 48: | Line 56: |
Shall we put the whole source into the PDF? What about tar.gz? '''Johannes 24Oct09 5:18pm''' | Thanks for the link, Alex, can you please explain the thing with the "bonus point of the exercise"? Is it that there were 15 bonus points to reach in the exercises? How many tasks in the exercises got bonus points and how many didn't? And the non-bonus tasks than only counted for admission to the exam? '''Hannah 13Dec09 23:36''' |
Line 50: | Line 58: |
Hi Johannes + all, the slides are now availabe as PDF, see the link above. '''Hannah 23Oct09 17:04''' | I quite liked this scheme, although it does not put that much weight on the exercises: http://cone.informatik.uni-freiburg.de/teaching/vorlesung/algorithmentheorie-w08/exam.html '''alex 13Dec09 23:17''' |
Line 52: | Line 60: |
'''Note about Exercise 5:''' One can assume that a more general model of the word frequencies is given than that given in the lecture, i.e. eps * N * (1 / i^alpha). Now both parameters (eps and alpha) can be estimated simultaneously. '''Marjan 23Oct09 3:29pm''' | Can someone please post the details of one of the existing bonus systems here? (Something like: for xyz % of the exercises, you can improve your exam mark by abc.) Or the links to a course site where these details are given. Thanks! '''Hannah 13Dec09 23:09''' |
Line 54: | Line 62: |
Can you provide the slides as PDF? '''Johannes 23Oct09 10:05am''' | To Mirko + all: Yes, it's d, I don't know how I've missed this one. '''Marjan 12Dec09 13:16''' |
Line 56: | Line 64: |
Please note that the deadline for uploading your solutions of the exercises is always Monday, 23:59 (sharp). '''Marjan 22Oct09 6:15pm''' When you add a question or comment here, please end it with your name and the date and time in bold face, just like I did now. '''Hannah 22Oct09 01:59am''' |
About Exercise 1: in the second part, is it really delta? shouldn't it be d? '''Mirko 12Dec09, 12:43''' |
Welcome to the Wiki page of the course Search Engines, WS 2009 / 2010. Lecturer: Hannah Bast. Tutorials: Marjan Celikik. Course web page: click here.
Here are PDFs of the slides of the lectures so far: Lecture 1, Lecture 2, Lecture 3, Lecture 4, Lecture 5, Lecture 6, Lecture 7, Lecture 8.
Here are .lpd files of the recordings of the lectures so far (except Lecture 2, where we had problems with the microphone): Recording Lecture 1, Recording Lecture 3, Recording Lecture 4, Recording Lecture 5 (no audio), Recording Lecture 6 (with audio for a change), Recording Lecture 7 (AVI), Recording Lecture 8 (AVI).
Here are PDFs of the exercise sheets so far: Exercise Sheet 1, Exercise Sheet 2, Exercise Sheet 3, Exercise Sheet 4, Exercise Sheet 5, Exercise Sheet 6, Exercise Sheet 7, Exercise Sheet 8.
Here are your solutions and comments on the previous exercise sheets: Solutions and Comments 1, Solutions and Comments 2, Solutions and Comments 3, Solutions and Comments 4, Solutions and Comments 5, Solutions and Comments 6, Solutions and Comments 7.
Exercise Sheet 8
The recordings of all lectures are now available, see above. Lecture 2 is missing because we had technical problems there. To play the Lecturnity recordings (.lpd files) you need the Lecturnity Player, which you can download here. I put the Camtasia recordings as .avi files, which you can play with any ordinary video player; I would recommend VLC.
Here are the rules for the exercises as explained in Lecture 2.
Here you can upload your solutions for Exercise Sheet 8.
Questions or comments below this line, most recent on top please
Here is Hint 2: It is not evident in the first case in Hint 1 below that S' ' ' is a monotone sequence. It looks monotone, since by induction hypothesis, S' ' is monotone and then we obtain S' ' ' by adding another transformation at the end. But note that the definition of monotone asks for *strict* monotonicity as far as insert and replace operations are concerned. This can me remedied by proving a slightly stronger statement, namely that for given x and y, there does not only exist a monotone sequence with length ED(x, y), but a monotone sequence with the additional property that all insert / replace operations occur at positions <= m, and all delete operations occur at positions << m+1. Hannah 14Dec09 22:46
Ok, here are two hints for Exercise 3. Hint 1: Let S be a sequence of transformation that transforms x into y. We have to show that there is a *monotone* sequence that transforms x into y and that is of the same length as S. For the induction step, differentiate between three cases, as in the proof of Lemma 2 in the lecture. Let's take as the first case that the last character of y is obtained by an insert or a replace operation of S. Remove that transformation from S, and, if it was an insert and not the last operation from S, decrease the positions of the subsequent transformation in S by one. Call the resulting sequence of transformations S'. Obviously S' is one shorter than S. Verify that S' transforms x into y', where y' is y without its last character. By the induction hypothesis, there now exists a *monotone* sequence S' ' which transforms x into y'. Append the insert / replace operation which we removed from S to S' ' (so that it indeed inserts / replaces the last character of y). Then S' ' ' transforms x into y and has the same length as S. The other two cases are that the last character of x is removed by a delete operation at some point, and that both the last character of x and the last character of y are untouched by any of the transformations in S. [Hint 2 will be added soon] Hannah 14Dec09 22:10
Hi all, I am on the train right now, I just finished writing a quite elaborate hint (using Thunderbird), but now it seems, Thunderbird has swallowed that mail draft. I'll try to find it again, and if not, have to write it again. I hate Thunderbird, I am having so many troubles with it. Hannah 14Dec09 22:03
To Johannes + All: Here is a hint from my side: Using the induction as the professor pointed out, one should proof that for any sequence of transformations of string x to string y, there exist a corresponding monotone sequence of transformations with the same length. Marjan 14Dec 20:00
Most humbly I ask for further hints for exercise 3. Johannes 14Dec09 19:53
Supplemental to Manuela + all: According to an (old) study, most of the words do not contain duplicate k-grams. Marjan 14Dec09 19:35
Hi Manuela + all: thanks for pointing out this problem. No, you don't have to consider this. You may either assume that the k-grams of each word are distinct, or consider A and B as multi-sets, that is, in case a k-gram occurs x > 1 times in a word it is counted x times in the set of k-grams for that word as well. In either case, the size of the set of k-grams of a word x is exactly |x| - k + 1. If that does not fully answer your question, please ask again. Hannah 14Dec09 19:20
I've got a problem with my formula for exercise 2. If I have the words x = bord and y = booo and I want to get the two-grams A = {bo,or,rd} and B = {bo,oo}, then in B there will be a two-gram "oo" lost, because of the set. My formula doesn't realize that and I don't know if I could fix it. Must we consider this problem? Manuela 14Dec09 18:58
To all again: if you want to get notification when someone added a comment to this page, just click on the Info / Subscribe link towards the top right. Then this Wiki page effectively becomes a mailing list for you. If you make only a trivial change to the page (like correcting a typo), then tick the box "Trivial change" before saving, then people will not be sent a notification for (almost) nothing. Hannah 14Dec09 14:49
To all: Exercise 3 is certainly the hardest on this sheet. Although again nobody has asked for a hint so far, here is one: You have to prove that ED(x, y) = EDm(x, y), where ED is the normal edit distance, and EDm is the edit distance where the sequence of transformations must be monotone, as defined in the lecture and on the sheet. ED(x, y) <= EDm(x, y) is trivial since every monotone transformation sequence is also a normal transformation sequence. To prove EDm(x, y) <= ED(x, y), the natural way is again to use induction over |x| + |y|, as done in the lecture for my proof of Lemma 2 (which didn't quite work out, but for other reasons). If you need more hints, ask. Hannah 14Dec09 14:46
Hi Björn, I don't understand why/how you would need that a transformation "knows" its position. I also don't see that there is any big formalism involved in what a transformation is. A transformation is one of insert / delete / replace, and it occurs at a particular position of the current string. That is a transformation, no more no less. Hannah 14Dec09 14:42
One question on exercise 3: Do we have to assume that each transformation is of a certain form (i.e. insert at i'th character of current word, where it matters how many deletes/inserts have been done previously)? Or can we assume that a transformation somehow "knows" its position? If we have to deal with it in an abstract way, should we create our own way of describing a transformation or is there a formalism we all should use. Björn 13:31
Here is another bonus point system: http://www.informatik.uni-freiburg.de:8081/swt/teaching/winter-term-2009/informatik-iii-theoretische-informatik. Additionally I would like to add that most of these bonus point systems have exercises which are far less work. Björn
In some other lectures the points from the sheets are used to increase the grade from the exam. If one got 50% then she/he got 0.3 grade better, 80% for 0.6 better, but min. 4.0 in exam. I.e. 83% of the exercise points and 2.3 in exam = 1.7 final grade. Data Mining & Machine Learning used a more complex scheme, there was theoretical sheets and practical sheets using Weka (the slides should be on electures server). Markus 14Dec09 9:23
Many exercise sheets contained two tasks and for each task we could get 1 point. That means that we could got 2 or even 3 points per sheet. The exercises were optional, but because of the bonus points most students did the exercises. There was another reason to do the exercises. In this lecture the exam was very similar to the exercise sheet tasks, so we had two considerable advantages. In two other lectures we had to achieve 30 and 50% of the exercise points to participate at the exam. Manuela 14Dec09 00:57
Now that I think about it, there were points for solving exercises in exercise-class. Also, there were more than 15 points achievable over the semester, but max. 15 were credited in the exam. alex 13Dec09 23:57
In that lecture we could reach max. 15 bonus points for the exercises. Each exercise sheet scored one point + one extra point for specially good/clever solutions. I don't think there was a constraint on admission to the exam. There might have been points for solving exercises in the exercise-class, but I'm not sure about that. (--> already one year ago) alex 13Dec09 23:48
Thanks for the link, Alex, can you please explain the thing with the "bonus point of the exercise"? Is it that there were 15 bonus points to reach in the exercises? How many tasks in the exercises got bonus points and how many didn't? And the non-bonus tasks than only counted for admission to the exam? Hannah 13Dec09 23:36
I quite liked this scheme, although it does not put that much weight on the exercises: http://cone.informatik.uni-freiburg.de/teaching/vorlesung/algorithmentheorie-w08/exam.html alex 13Dec09 23:17
Can someone please post the details of one of the existing bonus systems here? (Something like: for xyz % of the exercises, you can improve your exam mark by abc.) Or the links to a course site where these details are given. Thanks! Hannah 13Dec09 23:09
To Mirko + all: Yes, it's d, I don't know how I've missed this one. Marjan 12Dec09 13:16
About Exercise 1: in the second part, is it really delta? shouldn't it be d? Mirko 12Dec09, 12:43