Efficient algorithms - rules of pass
Classes schedule
Criteria for a course pass:
- the note from the course will be based on solved tasks on online checkers, and participation in a programming competition
- Participation in one programming competition is a mandatory prerequisite for passing the course. One can think of it as like an exam
A total of 75 points will be available for tasks on the checkers
- A total of 75 points will be available for tasks on online checkers
.
- the number of points earned for online checkers is directly proportional to the number of completed assignments given during the class
- The following numbers of "checker points" are awarded for each task:
- 2 - for task passed in deadline
- 1 - for task passed after deadline
- 0 - for task undone or being done wrong
- -1 - for a task done with cheating
Final results for online checkers will be calculated base on the formula:
75 * checker_points / 2 * task_number
- the teacher has the right to award additional points to students at his discretion (e.g. for activity)
- The remaining 25 points will be available for performance in the single/team programming competitions. The exact rules for awarding these points will be announced once the competition schedule and rules are known.
- To pass the course you need to obtain a total of more than 50 points.
.
- Whole scale of grades based on the percentage:
- 2: <= 50
- 3: 51 - 60
- 3,5: 61 - 70
- 4: 71 - 80
- 4,5: 81 - 90
- 5: 91 - 100
- 6: > 100
Bibliography:
- P. Stańczyk,
Algorytmika praktyczna
- J. Tomasiewicz,
Zaprzyjaźnij się z algorytmami
- N. Wirth, Wprowadzenie do
programowania systematycznego. Wydawnictwa Naukowo-Techniczne. Warszawa 1978.
- B. Eckel, Thinking in C, Beta 3 . 2006.
- B. Eckel, Thinking in C++, Wydawnictwo Helion, 2002
- J. Grębosz, Symfonia C++,
Oficyna Kallimach, Kraków 1993.
- T.H. Cormen, Wprowadzenie
do algorytmów, Wydawnictwa
Naukowo-Techniczne, Warszawa 2005 (lub wcześniejsze wydanie WNT,
Warszawa 1999)
- A. Struzińska-Walczak, K.
Walczak, Nauka programowania dla początkujących. C++, Wydawnictwo
W&W, Warszawa 2002,
- R. Neapolitan, K. Naimipour,
Podstawy algorytmów z przykładami w C++
Online checkers:
In this class we will be using a number of checkers and services to evaluate solutions to programming problems.
You will need to set up accounts on the following services:
Also please to join the contest on SPOJ
An account on ideon is also definitely useful.
Each problem appearing in class will appear on the list below with a due date.
A total of 75 points will be available for the assignments on online checkers. The number of points earned for online checkers is directly proportional to the number of assignments done in class.
The following numbers of "checker points" are awarded for each task:
- 2 - for task passed in deadline
- 1 - for task passed after deadline
- 0 - for task undone or being done wrong
- -1 - for a task done with cheating
Final results for online checkers will be calculated base on the formula:
75 * checker_points / 2 * task_number
Below is a task list with deadlines.
Tasks on the checkers can be solved throughout the semester, 24 hours a day, seven days a week. Checkers are available as online services that are active at all the time. The checker problems are settled at the time when the student wants to receive a final note.
Accepted tasks are problems that you have written yourself and that have been marked as "accepted" on the checker. You do not need to send the teacher the codes of successfully solved assignments.
If plagiarism solution is detected, it will be cancelled and, of course, the reputation of the student will be impaired. If plagiarism is detected at the time of the attempt the student may be graded lower than their marks (by withdrawing the appropriate number of acceptances on online checker and any additional marks).
You may also receive "checker" negative points for any plagiarism.
List of tasks processed in class along with deadlines: