Sample exam from 2011

As promised, here (exam_20110114_v2) is a sample exam from 2011. The exam has a total value of 46 points because only 4 points from exercise 2 are mandatory, and the extra 2 points value 6 more points. The minimum grade to pass the exam is 18/40 points.

Grades for lab & assignments have been updated

You can view your lab and assignment (H1 and H2 for now) scores here:

https://docs.google.com/spreadsheet/ccc?key=0AmILDkjkfxCWdDdjdDM4SVRhSUZZT0F5YlQwT2JPaVE&hl=en_US#gid=0

Homework 3 shall be assessed  until Thursday evening.

Slides available for download

I have uploaded an archive containing all the slides for the courses 1-11. Please download the archive and start reading the courses, plus the slides and the references.

Assignment 3 – 2012

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

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

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

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 (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

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

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.