Beskjeder

Publisert 12. des. 2012 14:38

There was an error in the slides for Dynamic Programming. The formula at the bottom of 269 was uncorrectly copied to the foils. The reursive formula on the slides says: m{k, j}, but it should be: m{k+1,j}. This is corrected in the english version of the slides.

Publisert 27. nov. 2012 02:52

Mandatory assignment 3 (first try) is now graded, check Devilry.

Publisert 22. nov. 2012 15:21

A set of test data for Oblig 3 is now posted on the web page. (tar.gz)

Publisert 21. nov. 2012 17:46

A few slides about Oblig 2, oppgave 3b and undecideability in general is posted on the Ukeoppgaver page for 15th Nov. (In Norwegian - English translation to follow.)

Publisert 6. nov. 2012 17:15

Those of you told to hand in new answers to Mandatory Assignment 2 must do so before we go through how to solve Exercise 3 on the November 15 group session.

Publisert 6. nov. 2012 09:54

Mandatory assignment 3 (Oblig 3) is now posted on the web page. Deadline (quite firm this time!) is November 23.

Publisert 6. nov. 2012 00:39

Mandatory Assignment 2 has now been graded. You should all have some kind of feedback in Devilry. Many have been asked to turn in a new set of answers to Exercise 3b. There will be a short discussion of Exercise 3 on the November 15 group session.

Publisert 26. okt. 2012 00:26

Test data A set of test data for mandatory exercise 2 is posted on the web page. (All permutations of tiles are not solvable start states.)

Publisert 23. okt. 2012 22:22

Now the slides from all the lectures exist in English. The last two (from 29/8 and 5/9) came today. All students are advised to look at the new English versions for these lectures, as some errors are corrected, and they are hopefully made easier to read.

Publisert 17. okt. 2012 00:24

Petter Kristiansen is away until 26. Oct, but will read and answer mail. Matias Holte (kjetimh at student.matnat.uio.no) will lead the gruop sessions 11., 18., 25. Oct.

Publisert 8. okt. 2012 14:53

Mandatory assignment 2 (Oblig 2) is now posted on the web page. Deadline is October 26.

Publisert 8. okt. 2012 03:09

The group session on 11th Oct will be held in room 1416 Aud Smalltalk.

Publisert 4. okt. 2012 22:00

Obligene er n? rettet, alle skal ha f?tt godkjent eller en annen form for (kort) tilbakemelding i devilry. De som m? levere p?ny og st?r fast p? noe kan sende mail til gruppel?rer. (Det vil som nevnt bli en kort gjennomgang med vekt p? 1b og 1d.)

Publisert 4. okt. 2012 12:07

Obligene rettes fortl?pende, alle er enn? ikke rettet. De som ikke har f?tt godkjent f?r selvsagt lov til ? gj?re forbedringer og levere p?ny. (Alle ikke-godkjente skal n? ha "open" i devilry - my bad.) Det vil bli en kort gjennomgang (med fokus p? 1b og 1d) n?r alle er ferdig.

Publisert 1. okt. 2012 23:55

Hvert ?r avholdes NM i programmering p? universitetene rundt om i landet. Dette er en lagkonkurranse for i algoritmer og probleml?sning som b?de er faglig engasjerende og sosial. I fjor tok UiO de to ?verste plassene p? resultatlista, og jekket dermed ned de ellers s? overlegne NTNUerne. Om du skal v?re med ? sl? NTNU, eller bare er interessert i ? m?te nye folk og f? anvendt noen av INF4130-skilsa anbefaler vi deg ? komme f?rstkommende l?rdag til koding og god mat!

For p?melding og informasjon se www.nm-i-programmering.no. Vel m?tt!

Publisert 1. okt. 2012 12:19

There was no lecture on 26th September, in the group session on 4th October we therefore look at some old exams, and go through a few assignments on the curriculum we have already covered.

Publisert 25. sep. 2012 20:17

The Devilry system NOW WORKS for INF9135 (PhD-students in INF4130).

Publisert 12. sep. 2012 15:17

Mandatory assignment 1 (Oblig 1) is now posted on the web page. Deadline is September 28.

Publisert 10. sep. 2012 13:48

Mandatory assignments: We have indicated that the three mandatory assignments will have deadlines: Sept 21, Oct 26, and Nov 16. The first assignment will appear soon, but the deadline will probably be postponed some days, as we are running a little late.

Publisert 10. sep. 2012 13:00

For those who have had problems getting the textbook: One can now buy most of the chapters we need from our textbook (except ch. 9 and 20 that can be found at the course-pages) as a "Kopisamling" (Copy collection) at "Kopiutsalget" at the lower floor of the Bookstore (Akademika). You should ask for: "INF4130, Utdrag fra boken: Algorithms: Sequential ... av Berman and Paul". Remember to bring proof ("Studiekort"?) showing that you are a student at UiO this year.

Publisert 7. sep. 2012 13:42

Now in English: It turns out that, contrary to what Stein K. thought, the rules for giving courses in English is strict also for 4000-courses. Thus, from now on, the language used in all parts of the course will be English, also in slides and assignments.

Publisert 22. aug. 2012 17:13

Mer om ? skaffe l?reboka: For det f?rste er det ingen voldsom hast, siden bok-stoffet til 29/8 og 5/9 blir lagt ut p? forelesningsplanen. Ellers ser jeg at "amazon.fr" har 7 eksemplarer og at "amazon.it" har 4 (og det er fremdeles 15 igjen p? "amazon.co.uk" (England)). B?de "amazon.com" og "textbooks.com" har den ogs?, men disse er i USA, og da blir kanskje leveringstiden veldig lang (men det g?r det kanskje an ? sjekke opp?).

Publisert 20. aug. 2012 14:15

Bare gruppe 1 (torsdag 12.15-14, f?rste gang 30/8) vil bli startet opp. Om det ikke er noe spesielt vil man da arbeide med oppgaver til forelesningsstoffet uka f?r.

Publisert 17. aug. 2012 17:26

Alt om forelesningene ligger p? "Detaljert undervisningsplan". "Tid og sted" for undervisningen blir ikke oppdatert.

Publisert 29. juni 2012 15:35

NB: Om ? skaffe l?reboka: Vi skal bruke samme l?reboka som i fjor, alts?:

Algorithms: Sequential, Parallel, and Distributed by Jerome Paul and Kenneth A. Berman.Men merk, den m? v?re fra okt. 2004 (copyrigt 2005).

Det har dessverre vist seg vanskelig ? f? tak i denne p? vanlig m?te gjennom Akademika og forlaget. Men, det er jevnlig noen eksemplarer ? f? kj?pt p? "http://www.amazon.co.uk", s? om du planlegger ? ta kurset anbefaler vi deg ? kj?pe boka der (eller et liknende sted) n?r den m?tte v?re ? f? tak i. Den kan v?re vanskeligere ? f? tak i n?rmere semesteret.

Dino Karabeg og Stein Krogdahl