4951
Comment:
|
7823
|
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]], [[SearchEnginesWS0910/ExerciseSheet8|Solutions and Comments 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]]. == ABOUT THE MID-TERM (TRIAL) EXAM == Ok, guys, thanks for your votes. '''The winner is Friday, December 18, 16 - 18 h.''' The exam will start at 4.00 pm, so please be there in time. I yet have to find a room, but that shouldn't be a problem at that time of the day and week and year. I will inform you once I know which room it is. Here are the rules of the exam: 1. It's an open book exam, that is, you can bring and use any amount of books, papers, etc. In particular, printout of the lecture slides, exercise sheets, your solutions, etc. Also any amount of private annotations and the whole CS library if you want. You won't need much for the exam though. I think what will be most useful are the slides, so that you can look up the basic definitions of stuff, in case you forgot them, and your solutions of the exercise sheets. 2. You are not allowed to use any computing devices, mobile phones, etc. In particular, you are not allowed to communicate with others or in any way connect to the Internet or something like that. You won't need a pocket calculator. In case you need to compute log_2(10/7), we will tell you what it is. Things like 2 * 0.5 or log_2(10/5) you should be able to compute by yourself. 3. Expect one or two tasks where you have to write code for some small functions. For example, a binary search in a list of strings. (No, that will not be a task of this exam.) You can use any of the standard languages: Java, C++, C#. Python and PHP are also ok if you absolutely must. Or you can also use pseudo-code. Anyway, you will be asked to write only relatively simple functions, which do not require any involved language-specific things. You should know basic data structures like arrays, lists, and hash tables though. 4. The material covered is simply everything that we did in the lectures and in the exercises, and nothing beyond that. Note that if you haven't really understood a topic, and then comes a task about that topic, you won't have enough time to go to the slides, understand it, and then solve the task. That is, you should have a basic understanding of everything we did, before the exam. If you did all the exercises, and did them well, chances are high that you have that understanding. 5. In the trial exam there will be 5 tasks of which you have to solve 4. Given that the total time for the exam is 2 hours, this means that you will have 30 minutes for each task on average. We will not be super-strict with the time, that is, if it's 6 pm and you need a little longer that is fine. 6. The exam questions will certainly be significantly easier than most of the questions in the exercises. And this is how it should be if you ask me. For the exercise you have time to think deep about certain problems, deal with the gory details of things, etc. and this is how one learns / understands stuff. In the exam, you should prove that you have understood all the stuff we did, no more and no less. There will, of course, be tasks that require some thinking, but no deep thinking. In particular, you won't have to prove that P != NP, or that Primes is in P. 7. This is a pure trial exam, which will not influence your final mark in any way. We will correct the exam like the real thing though and give you real marks, so that you get an impression of where you stand. 1. - 6. will also hold true for the final exam in this or very similar form. 7. obviously not. |
Line 14: | Line 41: |
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 very long even for a relatively small correction. See if you can find a smarter algorithm. '''Hannah 26Oct09 1:26pm''' | To Eric + all: I asked people in the last lecture, and the majority didn't want that the trial exam counted at all for anything. So that's how it is, it doesn't count for anything. Concerning your second question: yes, the final exam will also be open book. Indeed, as I wrote above, the final exam will be very similar to the trial exam, except that, guess what, there will be different tasks in the final exam, and the final exam will probably be a bit longer (three hours instead of two). That is exactly one purpose of this trial exam, that you know what to expect in the final exam. '''Hannah 17Dec09 1:54am''' |
Line 16: | Line 43: |
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''' 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''' 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 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''' 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''' 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 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''' Problem solved. To everybody: don't try to create multiple users with the same e-mail address. '''Johannes 25Oct09 00:21am''' 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''' No that is not my user name. '''Johannes 24Oct09 11:58pm''' Hi Johannes, if you are logged in as JohannesStork you should be able to see it, did you try that? '''Hannah 24Oct09 11:59pm''' 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''' 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''' Shall we put the whole source into the PDF? What about tar.gz? '''Johannes 24Oct09 5:18pm''' Hi Johannes + all, the slides are now availabe as PDF, see the link above. '''Hannah 23Oct09 17:04''' '''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 you provide the slides as PDF? '''Johannes 23Oct09 10:05am''' 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''' |
Two Questions: 1) Does this mean the mark won't count as an exercise sheet? And though won't count for anything. It is just to get an impression where we stand and how the final exam will be? 2) Will the final exam also be "open book"? '''Eric''' |
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, Solutions and Comments 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.
ABOUT THE MID-TERM (TRIAL) EXAM
Ok, guys, thanks for your votes. The winner is Friday, December 18, 16 - 18 h. The exam will start at 4.00 pm, so please be there in time. I yet have to find a room, but that shouldn't be a problem at that time of the day and week and year. I will inform you once I know which room it is.
Here are the rules of the exam:
1. It's an open book exam, that is, you can bring and use any amount of books, papers, etc. In particular, printout of the lecture slides, exercise sheets, your solutions, etc. Also any amount of private annotations and the whole CS library if you want. You won't need much for the exam though. I think what will be most useful are the slides, so that you can look up the basic definitions of stuff, in case you forgot them, and your solutions of the exercise sheets.
2. You are not allowed to use any computing devices, mobile phones, etc. In particular, you are not allowed to communicate with others or in any way connect to the Internet or something like that. You won't need a pocket calculator. In case you need to compute log_2(10/7), we will tell you what it is. Things like 2 * 0.5 or log_2(10/5) you should be able to compute by yourself.
3. Expect one or two tasks where you have to write code for some small functions. For example, a binary search in a list of strings. (No, that will not be a task of this exam.) You can use any of the standard languages: Java, C++, C#. Python and PHP are also ok if you absolutely must. Or you can also use pseudo-code. Anyway, you will be asked to write only relatively simple functions, which do not require any involved language-specific things. You should know basic data structures like arrays, lists, and hash tables though.
4. The material covered is simply everything that we did in the lectures and in the exercises, and nothing beyond that. Note that if you haven't really understood a topic, and then comes a task about that topic, you won't have enough time to go to the slides, understand it, and then solve the task. That is, you should have a basic understanding of everything we did, before the exam. If you did all the exercises, and did them well, chances are high that you have that understanding.
5. In the trial exam there will be 5 tasks of which you have to solve 4. Given that the total time for the exam is 2 hours, this means that you will have 30 minutes for each task on average. We will not be super-strict with the time, that is, if it's 6 pm and you need a little longer that is fine.
6. The exam questions will certainly be significantly easier than most of the questions in the exercises. And this is how it should be if you ask me. For the exercise you have time to think deep about certain problems, deal with the gory details of things, etc. and this is how one learns / understands stuff. In the exam, you should prove that you have understood all the stuff we did, no more and no less. There will, of course, be tasks that require some thinking, but no deep thinking. In particular, you won't have to prove that P != NP, or that Primes is in P.
7. This is a pure trial exam, which will not influence your final mark in any way. We will correct the exam like the real thing though and give you real marks, so that you get an impression of where you stand.
1. - 6. will also hold true for the final exam in this or very similar form. 7. obviously not.
Questions or comments below this line, most recent on top please
To Eric + all: I asked people in the last lecture, and the majority didn't want that the trial exam counted at all for anything. So that's how it is, it doesn't count for anything. Concerning your second question: yes, the final exam will also be open book. Indeed, as I wrote above, the final exam will be very similar to the trial exam, except that, guess what, there will be different tasks in the final exam, and the final exam will probably be a bit longer (three hours instead of two). That is exactly one purpose of this trial exam, that you know what to expect in the final exam. Hannah 17Dec09 1:54am
Two Questions: 1) Does this mean the mark won't count as an exercise sheet? And though won't count for anything. It is just to get an impression where we stand and how the final exam will be? 2) Will the final exam also be "open book"? Eric