Fundamentals of Algorithms and Programming
Study programs
Teaching information
Teaching form
Lecture, Laboratory exerciseStudy method
Attendance, Combined, DistanceHours per week (full-time)
3,2Hours per semester (part-time)
ZS 39,26Teachers
doc. Ing. Eva Chovancová, PhD. Ing. Tomáš Kormaník RNDr. Ivana Varga, PhD. Mgr. František Kurimský Ing. Marek Horváth doc. Ing. Emília Pietriková, PhD. doc. Ing. Peter Papcun, PhD. Ing. Lenka Bubeňková Ing. Ardian Hyseni Ing. Richard Král Ing. Matúš Dopiriak Ing. Ján Staš, PhD. doc. Ing. Matej Bereš, PhD. Ing. Miroslav Murin Ing. Filip Gurbáľ, PhD. Ing. Samuel Novotný Ing. Dominika Líšková Ing. Zuzana Sokolová, PhD. Ing. Peter Bober, PhD. Ing. Tomáš Lenger, PhD. Ing. Erika Abigail Katonová
Schedule
Learning outcomes
Achieving the basic knowledge and skills for analyze, design and creation of algorithms and also the implementation and testing the selected tasks in the form of programs in procedural language.
Course outline
1. Introduction to computer science 2. Algorithm - definition, representation, flow-charts 3. Structured and non-structured data types 4. Boolean and arithmetic expressions 5. Control constructions - branching, cycles 6. Input, output 7. Subroutines and functions, recursion 8. Program life-cycle: compilation, running, debugging 9. One-dimensional and multi-dimensional arrays 10. Record 11. Analysis and synthesis of algorithms in examples
Completion conditions
Assessment and completion of the course: Credit test and examination Continuous assessment: Student passes the continuous assessment and receives credits when he or she meets the requirement to obtain at least 11% out of 20%. tests, project Final assessment: Student passes the final assessment and passes the examination when he or she meets the requirement to obtain at least 41% out of 80%. final test, exam Overall assessment: Overall assessment is the sum of the assessments obtained by students in the assessment period. The overall result is determined in accordance with the internal regulations of the Technical University in Košice. (Study Regulations, the internal regulation principles of doctoral studies)
Recommended literature
1. Biňas, M. Programovanie v jazyku C. Košice: Elfa, 2021. ISBN 978-80-553-3963-4. 2. Herout, P. Učebnice jazyka C. 1. díl. České Budějovice: Kopp, 2009. 271 s. ISBN 978-80-7232-363-8. 3. Herout, P. Učebnice jazyka C. 2. díl. České Budějovice: Kopp, 2010. 165 s. ISBN 978-80-7232-367-8. 4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C. Introduction to Algorithms. 3. vyd. Cambridge: MIT Press, 2009. 1292 s. ISBN 978-0-262-03384-8. 5. Kernighan, B. W., Ritchie, D. M. C Programming Language. 2. vyd. New York: Prentice Hall, 1988. 272 s. ISBN 978-8120305960. 6. Zakkula, R. Mastering C Programming. Birmingham: Packt Publishing, 2022. 400 s. ISBN 978-1-83921-705-1. 7. Albahari, B., Albahari, J. C# 10 in a Nutshell: The Definitive Reference. 8. vyd. Sebastopol: O'Reilly Media, 2022. ISBN 978-1-098-62117-6.
Notes
Prednášky predmetu sú realizované dištančnou metódou vzdelávania. Cvičenia sú realizované prezenčnou metódou vzdelávania.Pre úspešné absolvovanie predmetu sa od študenta očakáva aktívna účasť na vzdelávacích činnostiach priamej výučby (prednášky, cvičenia), ako aj samostatné štúdium a samostatná tvorivá činnosť pri spracovaní semestrálnych projektov (zadaní) na stanovenú tému. Časová náročnosť: 8hod/týždeň.
Grade distribution
Total graded students: 12286