Assignment 2 Results

January 23, 2017

The results for assignment 2 were posted in the grade register.
Some of the submissions are suspected of cheating. According to the rules, we can remove the whole score of 7.5 for the problem in question. We decided that if the students come clean and explain, we will give full points to the source and 0 points to the person who copied, for the copied problem(s).

For any grading related problem, including cheating, you can contact me at crisojog@gmail.com.


Assignment 3 – 2016-2017

January 9, 2017

Last update: 15-Jan-2017 21:30: The deadline for this assignment has been extended for another week. The new deadline is for 27-Jan-2017 at 23:55, and it remains a hard deadline.

The third assignment has been published here.You can find PUBLIC tests for both problems 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:

  • Stores.java
  • GameOfADC.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 choose to implement in C/C++, you need to provide a Makefile with at least these 4 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
  • clean – a rule that removes the binary files (not the source code files!)

Makefile examples:

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

Each problem has 75p out of the 150p total.  For each problem, there are 12 tests, each worth 5p. Additionally, if you pass at least one test for a given problem, 7.5p will be awarded for a proper Readme description, and 7.5p will be awarded for using proper Coding Style. Here you can find some Coding Style suggestions.

The HARD deadline for the assignment is 27 Jan 2017, 23:55. After this date, you may no longer be able to upload your assignment.

Any questions can be addressed as comments on this post.

This assignment will be solved individually. Copied sources will be penalized, both for source and destination. 

Note: If you wish to solve the assignment in a different programming language (Python, Matlab, etc.) send us an email with the name of the chosen programming language and the compiler/interpreter that you plan to use. Please make sure that the code you send can read the input from file and print the output in a file, as required for Java and C++. Also, don’t hesitate to contact us if you have a question related to the programming language that you’ve chosen.


Assignment 2 – 2016-2017

December 13, 2016

Last update: 16-Dec-2016 23:45

The second assignment has been published here. You can find sample tests for both problems 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:

  • UltimateTeam.java
  • MazeEscape.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 choose to implement in C/C++, you need to provide a Makefile with at least these 4 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
  • clean – a rule that removes the binary files (not the source code files!)

Makefile examples:

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

Each problem has 75p out of the 150p total.  For each problem, there are 12 tests, each worth 5p. Additionally, if you pass at least one test for a given problem, 7.5p will be awarded for a proper Readme description, and 7.5p will be awarded for using proper Coding Style. Here you can find some Coding Style suggestions.

The soft deadline for the assignment is 8 Jan 2017, 23:55. After this date, for each late day, you will be penalized with 7.5p. Seven days after the soft deadline you will no longer be able to upload your assignment.

Any questions can be addressed as comments on this post.

This assignment will be solved individually. Copied sources will be penalized, both for source and destination. 

Note: If you wish to solve the assignment in a different programming language (Python, Matlab, etc.) send us an email with the name of the chosen programming language and the compiler/interpreter that you plan to use. Please make sure that the code you send can read the input from file and print the output in a file, as required for Java and C++. Also, don’t hesitate to contact us if you have a question related to the programming language that you’ve chosen.


Assignment 1 – 2016-2017

November 18, 2016

Last update: 5 – Dec – 2016 – 18:10

The first assignment has been published here.

UPDATE: In order to test your solutions locally we have made the entire test sets public for both problems. You can find those here. Please note that we will remove all points for assignments where we find hardcoded tests.

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:

  • Scrambled.java
  • Two_cranes.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 choose to implement in C/C++, you need to provide a Makefile with at least these 4 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
  • clean – a rule that removes the binary files (not the source code files!)

Makefile examples:

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

Each problem has 75p out of the 150p total.  For each problem there are 12 tests, each worth 5p. Additionally, if you pass at least one test for a given problem, 7.5p will be awarded for a proper Readme description, and 7.5p will be awarded for using proper Coding Style. Here you can find some Coding Style suggestions.

The soft deadline for the assignment is 04.12.2016 23:59. After this date, for each late day you will be penalized with 7.5p. 10 days after the soft deadline you will no longer be able to upload your assignment.

Any questions can be addressed as comments on this post.

This assignment will be solved individually. Copied sources will be penalized, both for source and destination. 

Note: If you wish to solve the assignment in a different programming language (Python, Matlab, etc.) send us an email with the name of the chosen programming language and the compiler/interpreter that you plan to use. Also, don’t hesitate to contact us if you have a question related to the programming language that you’ve chosen.


Assignment 3

January 3, 2016

The third 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.

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

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 files
  • run-p1 – a rule that runs the binary for the problem

Makefile examples:

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 17.01.2016 23:59.

Any questions can be addressed as comments on this post.

Note: If you wish to solve the assignment in a different programming language (Python, Matlab, etc.) send us an email with the name of the chosen programming language and the compiler/interpreter that you plan to use. Also, don’t hesitate to contact us if you have a question related to the programming language that you’ve chosen.


Assignment 2

December 7, 2015

Latest Update: 31.12.2015 We made 3 more sample tests available for the second problem.

The second 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.

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

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

  • Forest.java
  • Wrob.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:

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 03.01.2016 23:59.

Any questions can be addressed as comments on this post.

Note: If you wish to solve the assignment in a different programming language (Python, Matlab, etc.) send us an email with the name of the chosen programming language and the compiler/interpreter that you plan to use. Also, don’t hesitate to contact us if you have a question related to the programming language that you’ve chosen.


Assignment 1

November 15, 2015

Last update to this post: 01.12.2015 (extra sample tests for FileDiff)

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:

  • FileDiff.java
  • Tunnel.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:

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 01.12.2015 23:59.

Any questions can be addressed as comments on this post.

Answered Questions:

Q1 (FileDiff): Two lines are considered equal if they contain the same ASCII alphabet characters, in the same order.

For example, the line “To be or not to be” is considered the same as “To be, or, not  to be” but different from “Not to be or to be”

Q2 (FileDiff): A file may contain any number of duplicate lines.

Update:  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


Assignment 1

November 17, 2014

The first assignment has been published. You can read it here.

The assignment should be sent by email to adcfils+assignment1@tudalex.com.

The archive should not contain any binary files or .class files. Additional rules may be found here.

The deadline for the assignment is 2.12.2014 23:59.

Any questions can be addressed as comments on this post.


Assignment 3 – 2013-2014

January 9, 2014

Here you have a link to the third assignment for 2013-2014 academic year.

The rules are explained in the assignment page.

– Cheating is not permitted.

Comment this post if you have any questions about the assignment.

Deadline: 22nd of January 2014, at 23:59


Assignment 2 – 2013-2014

December 9, 2013

Here you have a link to the second assignment for 2013-2014 academic year.

– The rules are explained in the assignment page.

– Cheating is not permitted.

Comment this post if you have any questions about the assignment.

Deadline: 23rd of December 2013 @ 23:55