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

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

In case you have not noticed yet, all the lecture slides are available on Slideshare (https://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

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: https://adcfils.wordpress.com/assignements/

– Cheating is not permitted

Comment this post if you have questions about the assignment.

Homework for Lab 5

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

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

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

1231E – 16:00

1232E – 18:00

Room JA001A