QuickTopic free message boards logo
Skip to Messages

TOPIC:

Advanced Algorithmics 2015

^     All messages            52-67 of 67  36-51 >>
67
Gustav
01-12-2016
08:13 AM ET (US)
For anyone struggling with SHIFT-AND algorithm

This site helped me understand it better: http://videlalvaro.github.io/2014/01/shift-and-visualization.html
66
Irene
01-05-2016
11:47 AM ET (US)
Hi Gustav,

The submit option is now created.
65
Gustav
01-05-2016
11:39 AM ET (US)
The submit menu is missing the option for project poster.
64
Jaak Vilo
12-07-2015
02:14 AM ET (US)
Yes, the start time was posponed by 2h due room (non)availability.
-Jaak
63
Anti
12-06-2015
06:38 PM ET (US)
Do I remember correctly that the starting time of the poster session changed to 12:15?
Currently on the website and slides there is still 10:15.
62
Jaak Vilo
12-02-2015
02:10 PM ET (US)
No, they are not.

Tuesday was a holiday at university. But tomorrow there is a lecture.
-Jaak
61
Dmytro
12-02-2015
01:26 PM ET (US)
I am wondering if lectures have been finished already ?
60
Jaak Vilo
11-30-2015
03:08 AM ET (US)
Not sure what you mean by "capping at 30 points the main flow" - all points are added together and you can earn many more than 100 points.
However,
* 50% is obligatory in exams
* Essay and Project reports are also obligatory.

-Jaak
59
Dmytro
11-29-2015
10:52 AM ET (US)
This specific question personally to Jaak Vilo:

What if in the main flow people have more than 30 points, should they do more exercise in this section or should they concentrate more on bonuses and do main part if and only if they are interested and have time ?

The rumor that we have heard main points will be cut to 30 only, but in other case from previous years are known that points were not cut down.

The reasons why I am asking:
- it is hard time for everyone
- priorities in life are important and sometimes we should prefer more valuable things first
58
Jaak Vilo
11-27-2015
05:41 PM ET (US)
Panopto for some reasos sometimes does not upload the video
(automatically). Now it should be there - it's encoding currently. http://panopto.ut.ee/Panopto/Pages/Session...393-6306f1b5c8cb%22
I added both files - the presentation PPT in PDF. as well as the Google Doc in here. These are sme proposals only...
https://courses.cs.ut.ee/2015/algorithmics/fall/Main/Projects

Please when you have yout team and idea fixed, fill in your project data in here:
https://docs.google.com/document/d/1xz-7l1...YDBPnQam5ylKiw/edit#
-Jaak
57
Sergio Figueroa
11-27-2015
11:02 AM ET (US)
Hi,

Do you know if the ideas for possible projects are available somewhere? I can't find them...
56
Irene
11-23-2015
10:59 AM ET (US)
@Gustav

Sorry for that, it is open now.
55
Gustav
11-23-2015
10:53 AM ET (US)
Option for the 11th homework is missing in the submission page.
54
Jaak Vilo
11-22-2015
02:29 PM ET (US)
Please make it a full closed circle.
n edges, not n-1.

-Jaak
53
Dmytro
11-22-2015
05:50 AM ET (US)
First task, all cities should be connected, but should it be cycle or tree ?

For example, we have 1 2 3 4 cities.

For, NN it can be 1 -> 3 -> 4 -> 2 or we need add extra transition in the end 2 -> 1 ?
52
BolotPerson was signed in when posted
11-08-2015
05:22 PM ET (US)
Hi,

In 2nd point, how many times do we need to multiply matrices? I implemented Warshall algorithm and multiplied matrices but results don't match.

In 4th point, Can you explain how can we compare speed of the random walk over the matrix multiplication?

Thanks in advance
Edited 11-09-2015 03:15 AM
^     All messages            52-67 of 67  36-51 >>

Print | RSS Views: 1384 (Unique: 332 ) / Subscribers: 19 | What's this?