Algorithms and Data Structures, 7.5 credits

Administrative information
Official external web page:	http://www2.hh.se/staff/vero/nw2ads/
Syllabus (pdf)	Syllabus translation
Schedule
Study period:	1
Course code:	DB4002_EN
Programme:	Network
Course Examiner:	Stefan Karlsson
Main Lecturer:	Veronica Gaspes

NOTE:

The webpage containing the excercises is maintained by Veronica, and accessed

here

. Do take care that news might be posted on the page you are currently at.

News

(older posts)

(2010-05-05)

Example exams are available :

26-10-2004.pdf external link

and 26-10-2004Solution.pdf external link

25-10-2005.pdf external link

and 25-10-2005Solution.pdf external link

15-8-2005.pdf external link

and 15-8-2005Solution.pdf external link

Ignore question no. 5 on the first example (26-10-2004). Anything on Sequence alignment will not be on the exam. I will also not require you to write Java code on the exam (pseudo code explanation will do if that sort of question comes).
There will be at least one occasion where we can go through problems of the old exams together. NOTICE that you can also ask me about the exams on the computer session occasions.
Regarding the final score for you, the exam this year will give a maximum of 65 points. The two assignments will give (together) a maximum of 25 points. The points from each source is added together to give the final grade (assuming that you have a minimum of a passed level on all compulsory tasks)

(2010-05-17)

On Wednesday, Thursday and Friday I will be in the Linux room(B231c) from 10 am to 12. On Thursday, between 10 and 12, I will go through the old exams with solutions. I could potentially do this on wednesday or friday instead. Email me if you have collisions

Lab-Excercises:

Getting started
PRE-excercises can be done by students to assure they know the basics (skip point 7 on the page on impedance). Students can ask about these PRE-excercises as well during sessions in the computer room, but do not spend too much time on this.
Lab 1 (the page says exercise 2, but this to be ignored, it is no.1) on Generics and Inheritance is for the first session
Lab 2 on time complexity analysis. Task no 3 in Lab 2 may look strange to you. It involves a function (smallRecursiveFib) that "talks to itself". In the function body, there is a call to the function itself. This is what is referred to as a recursive call, and I will take this up on the white board with some further examples if you have difficulties. Much of this lab is theoretical, and does not need a computer. Its always a good idea to BRING PEN AND PAPER.
Lab 3 on basic datastructures. SKIP TASK NO. 3. Stacks, Queues and Lists are VITAL to anything that you will want to do in anything related to programming. ESPECIALLY, in networking. Take my advice, go through this and understand it thoroughly.
There are several more labs that you can look through in preparation of the exam. These are found here , here and here

Programming Assignments

For the programming assignments, you will be required to report on them officially and understandably. Some students will be randomly picked and notified by email, to either report in my office on the assignment, or in the lab session in front of the class. If you are prepared to do it in the class room I will be more lenient, and you may get a bonus point.

Assignment 1 - 15 points. The topic will be on time complexity and basic datastructures. Understanding of Lab 2 and Lab 3 above will help you.
Assignment 2 - 10 points (Available from week 19, 10th of May). The topic will be Sets and Graphs. Assignment 2 will be smaller and easier then the first one.

Course Organization and objectives