|
||
A first course about programming and algorithms for first-year students studying computer science and computer
science education. The course covers principles of algorithms, basic algorithms, data structures, programming
techniques, typical programming environments and practical program design and debugging.
Last update: Töpfer Pavel, doc. RNDr., CSc. (09.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.
Cheating on a test or a homework assignment may result in automatically failing the course. Last update: Holan Tomáš, RNDr., Ph.D. (11.10.2022)
|
|
||
Last update: Töpfer Pavel, doc. RNDr., CSc. (25.05.2022)
|
|
||
Input and output. File processing. Last update: Dvořák Tomáš, doc. RNDr., CSc. (23.09.2019)
|