Algorithm Design and Complexity - FILS

Assignment 3 – 2012

andavintila — Fri, 06 Jan 2012 14:19:09 +0000

Here you have a link to the third assignment.

You can send it until 22nd January 2012, 23:59.

Assignment3

- The rules are explained in the assignment page: http://adcfils.wordpress.com/assignements/

- Cheating is not permitted

Comment this post if you have questions about the assignment.

Lab 6

andavintila — Fri, 06 Jan 2012 14:16:29 +0000

1. Compute the minimum spanning tree of a given graph using Kruskal’s algorithm.

2. Find the shortest path in a graph from a given source node to a given destination using Dijkstra’s algorithm.

Lab 5 Applications for DFS

andavintila — Fri, 06 Jan 2012 14:11:19 +0000

1. Find the strongly connected components of a given graph.

2. Find the articulation points of a given graph.

Course rescheduled this week – Tuesday 20th December, 10 AM

Traian Rebedea — Mon, 19 Dec 2011 16:43:52 +0000

As we discussed last Friday, this week’s lecture was moved from Friday, Dec 23rd, to Tuesday, Dec 20th. The lecture is scheduled in room EG301 (Automatica/Energetica), the same room used for the last lecture held in Automatica.

Course slides available on Slideshare

Traian Rebedea — Sun, 11 Dec 2011 14:29:48 +0000

In case you have not noticed yet, all the lecture slides are available on Slideshare (http://adcfils.wordpress.com/category/course-presentations/ and http://www.slideshare.net/TraianRebedea/presentations). However, attending the lectures brings more insight into the lecture slides and provides a way of finding out possible exam subjects as I address you several questions (and we discuss them) that may be exam subjects.

Assignment 2 – 2011

andavintila — Mon, 05 Dec 2011 20:46:06 +0000

Here you have a link to the second assignment.

You can send it until 19th of December 2011, 23:59.

Assignment2

- The rules are explained in the assignment page: http://adcfils.wordpress.com/assignements/

- Cheating is not permitted

Comment this post if you have questions about the assignment.

Homework for Lab 5

andavintila — Mon, 05 Dec 2011 18:09:21 +0000

Because the second problem from lab 4 is an important one you need to solve it for the next lab.

I am sorry for the problems we had with lab 4.

Here is the problem again:

Given a m*n cell maze with two kinds of cells: empty and obstacle, a source cell and a destination cell, find the shortest path from source to destination, using BFS.

Lab 4 Graph Search Algorithms

andavintila — Mon, 05 Dec 2011 17:31:05 +0000

1. Check if a directed graph is cyclic, using DFS.

2. Given a m*n cell maze with two kinds of cells: empty and obstacle, a source cell and a destination cell, find the shortest path from source to destination, using BFS.

Lab 3 Dynamic Programming

andavintila — Mon, 05 Dec 2011 17:22:45 +0000

1. Find the maximum contiguous subsequence sum in an array of integers.

2. Consider a row of n coins of values v(1) …v(n), where n is even. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first. (Consider the other player is smart and makes the best choice.)

Next Lab – 5th of December

andavintila — Fri, 02 Dec 2011 12:13:05 +0000

1231E – 16:00

1232E – 18:00

Room JA001A