Search
The course focuses on understanding and mastering basic design principles of algorithms. It develops data abstraction coupled with the essential programming patterns. The emphasis is on creating readable and reusable programs.
( lectures | labs | tutorials | literature BE5B33PRG TIME SCHEDULE (EN))
After agreement. Concrete problems will be discussed hence come with open problems you are struggling with. You may consider watching and listening and also do not forget to read and practice Wentworth2012.
Both the exam as well as the mid-term/end-of-term tests are multiple choice tests, no materials and no devices are allowed (papers will be provided, only own pen is necessary). Any use of materials, devices or cooperation during the exam / test will be awarded with 0 points (fail).
The content of the exam / test will be based on the content of:
Important dates:
- Mid-term test date: 23.11.2018 (during the lecture)
- End-of-term test date: 04.01.2019 (during the lecture)
- Final exam: Final exam will be at 8:00 - 12:00, room KN:E-112 on dates 18.1 2019, 25.1. 2019, 1.2. 2019, and 15.2. 2019 (final term) Use the Faculty information system KOS to enrol, watch carefully for the room number, exact date and time. Information on this website is only informative, the valid dates and times are in the KOS system.
Points: 50 homework (mostly coding), 20 mid-term tests during the term (2 tests, 10 points each), 30 final exam. At least 30 points (out of 70) are needed before going to the final exam (in order to obtain “zapocet”). At least 10 points (out of 30) are needed to pass the exam. Extra points for discussions and bonus homework count to the total sum of 70 points.
F means fail.
Michal Reinstein, Ahmet Iscen