New platform

This year we have been using piazza.com to host resources and announcements about the course.

If you haven’t registered yet, please follow this link. (and add a comment to this post)

The statement for the first assignment has been published here.

 

ADC Exams, September 2018

The ADC exams are scheduled on the 6th and 7th September, at 2pm, in room PR001.

Room PR001 is in Precis building (the new building of the A&C Faculty), ground floor.

ADC Exam, 5th Feb 2018, starts at 2PM

The ADC exam will start at 2PM, and not at 1PM as scheduled on the FILS website.
The duration of the exam in 90 minutes.

I appreciate if you can disseminate this information to your colleagues which are not reading the ADC blog regularly.

Exam resources

Update: Solution to the last exercise we discussed: https://goo.gl/j4Darh

================================================================

Update: We’ll discuss possible exams subjects this Saturday, 02.02.2018, in the 10:30 – 12:30 interval. We’ll meet in JA001, as usual.

Exam samples from previous years:

Exam_v1

Exam_v2

Exam_v3

Every course is available here.

A link to several examples (+solutions) of recurrences solved using the Master Theorem.

A quiz from MIT on the subject of asymptotic complexities.

If you have any questions, please don’t hesitate to post a comment.

We would appreciate if you can take a minute to leave some feedback.

Assignment 3 2017-2018

Update: Added some additional small tests to debug your solution on small graphs.

Update: The deadline has been extended with 2 days.

=====================================

The third assignment has been published here.

You can test your solutions on vmchecker.

Sample tests

If you choose to implement in Java, the archive must contain:

• Radiation.java
• Readme

Important! The java files must not have any package declaration in it. If it has, then remove it before uploading the archive. Otherwise, only if you want to use a different structure, you will need to provide a Makefile.

If you implement in C/C++, you need to provide a Makefile with at least these 2 rules:

• build     – a rule to build the binary file
• run-p1  – a rule that runs the binary for the problem

Makefile examples:

• Makefile for C++
• Makefile for Java

Remember to describe in the Readme file the algorithm used in your solution, and its complexity.

Coding style suggestions.

The deadline for the assignment is 21.01.2018 23:59. (soft deadline)

Any questions can be addressed as comments on this post.

Assignment 2 2017-2018

Update 18.12.2017:

You can now upload your solutions on vmchecker. There will be a bonus for the fastest solutions to the the first problem. 

Update 14.12.2017:

I’ve uploaded sample tests for the first and second problem.

========================================================

The second assignment has been published here.

It will be available on vmchecker very soon.

If you choose to implement in Java, the archive must contain:

• Plants.java
• Madripoor.java
• Readme

Important! The java files must not have any package declaration in it. If it has, then remove it before uploading the archive. Otherwise, only if you want to use a different structure, you will need to provide a Makefile.

If you implement in C/C++, you need to provide a Makefile with at least these 3 rules:

• build     – a rule to build the binary files
• run-p1  – a rule that runs the binary for the first problem
• run-p2  – a rule that runs the binary for the second problem

Makefile examples:

• Makefile for C++
• Makefile for Java

Remember to describe in the Readme file the algorithm used in your solution, and its complexity.

Coding style suggestions.

The deadline for the assignment is 08.01.2018 23:59. (HARD deadline, no later submissions accepted)

Any questions can be addressed as comments on this post.

Laboratory recovery – 08.12.2017

Hello everyone,

We are going to recuperate the laboratory that we missed on 1 December this Friday, 08.12.2017, in the 12:00-14:00 interval.
The topic of the laboratory will be graph algorithms [0]: we will discuss how to represent a graph in memory [1] and review some simple graph applications.

I strongly encourage you to come this Friday; The notions we are going to discuss will be necessary to solve the second assignment (which will be published shortly) and, in a more general way, you will hopefully find the opportunity to apply them in future projects/job interviews.

[0] https://adcfils.wordpress.com/2010/12/09/course-7/
[1] https://adcfils.wordpress.com/2015/01/05/graph-representation-quick-tutorial/

Assignment 1 2017-2018

Last Update 01.12.2017:

Readme file should be a plain text file (so that it can be easily read on any operating system/environment).

In Java, if you use Scanner [0], you need to specify the correct charset for the second problem (“UTF-8” [1]):

new Scanner(new File(fileName), "UTF-8");

However, I suggest you use BufferReader instead. [2] (an explanation [3])

[0] https://docs.oracle.com/javase/9/docs/api/java/util/Scanner.html
[1] https://en.wikipedia.org/wiki/UTF-8
[2] https://docs.oracle.com/javase/9/docs/api/java/io/BufferedReader.html
[3] http://www.geeksforgeeks.org/difference-between-scanner-and-bufferreader-class-in-java/

========================================================================

 

The first assignment has been published here.

You are now able to upload the archive with your solution, for automatic judging on vmchecker. You can log in on it using your moodle accounts.

If you choose to implement in Java, the archive must contain:

• Tunnel.java
• FileDiff.java
• Readme

Important! The java files must not have any package declaration in it. If it has, then remove it before uploading the archive. Otherwise, only if you want to use a different structure, you will need to provide a Makefile.

If you implement in C/C++, you need to provide a Makefile with at least these 3 rules:

• build     – a rule to build the binary files
• run-p1  – a rule that runs the binary for the first problem
• run-p2  – a rule that runs the binary for the second problem

Makefile examples:

• Makefile for C++
• Makefile for Java

Sample tests for the two problems: sample_tests (these are some of the tests actually used for evaluating your solution)

Remember to describe in the Readme file the algorithm used in your solution, and its complexity.

Coding style suggestions.

The deadline for the assignment is 04.12.2017 23:59.

Any questions can be addressed as comments on this post.

 

A set of small sample tests for the FileDiff problem, that are easier to debug but require that you implement the minimum lexicographically condition correctly:  File Diff extra sample tests

Lecture & lab from 29 Sep 2017 postponed

As I am attending a conference until the end of the week, the ADC lecture and lab scheduled this Friday (29 Sep 2017) are postponed.

ADC 2017 Autumn Exam

The autumn exams are scheduled on 5th September, room EC105, and 7th September, room PR001. The starting time is 11am.