|
|
|
||
Last update: G_M (24.04.2012)
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (11.10.2017)
Students will receive a credit for this course by successfully completing the following requirements:
Due to the nature of the first two requirements, a failed attempt cannot be repeated as is possible for exams. The instructor may establish conditions whereby a student can make up for missing homework assignments or resubmit their semester project after improving deficiencies that were found the first time around.
A student has three chances to pass the written test, normally by the end of the winter exam period. The instructor may choose to allow a student to make one or more of these attempts during the following summer semester. |
|
||
Last update: RNDr. Tomáš Holan, Ph.D. (29.10.2019)
P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vyd. 2007 P.Satrapa: Pascal pro zelenáče, Neocortex Praha 1994 N.Wirth: Algorithms + Data Structures = Programs , Prentice Hall Englewood Cliffsů; New Jersey 1975 slovenský překlad N. Wirth: Algoritmy a štruktúry údajov, Alfa, Bratislava 1989 |
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (11.10.2017)
Working with an IDE (integrated development environment), creating and debugging programs - practically demonstrated using the Turbo Pascal or Free Pascal IDE (editor, compiler, debugging tools - tracing, examining variable values etc.) |