|
Lecturer(s)
|
|
|
|
Course content
|
1. Introduction to programming, basic programming concepts, higher programming languages, programming paradigms 2. Concept of algorithm, basic properties of algorithm. 3. Principles of dividing a problem into subproblems. 4. Methods of writing algorithms - CSN ISO 5807, flowchart - symbolic algorithmic language for representation information processing algorithm 5. Sequential algorithms, Branching algorithms., 6. Cyclic algorithms., Sorting algorithms. 7. Propositional logic - logical connectives, propositional logic language symbols, syntactic rules, interpretation rules. 8. Development environments, basic programming language elements and conventions. 9. Data type, variables, literals, constants, expressions, operators, statements, floating point number representation 10. Overview of operators, commands, overriding, 11. Flow control commands 12. Formatted output, classes, objects, arrays, errors in programs 13. Interfaces, exceptions, text files
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Demonstration, Skills training
- Contact teaching
- 26 hours per semester
- Home preparation for classes
- 26 hours per semester
- Contact teaching
- 8 hours per semester
- Individual project
- 13 hours per semester
- Preparation for a credit (assessment)
- 26 hours per semester
- Home preparation for classes
- 16 hours per semester
|
|
Learning outcomes
|
The aim of the course is to introduce students to the basics of algorithmization, algorithmic way of thinking and to prepare students to learn the basics of programming. After completing the course, the student is able to independently design a solution algorithm and program the solution.
The aim of the course is to introduce students to the basics of algorithmization, algorithmic way of thinking and to prepare students to learn the basics of programming. After completing the course, the student is able to independently design a solution algorithm and program the solution.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written examination, Self project defence
|
|
Recommended literature
|
-
Knuth, Donald Ervin. Umění programování.. Brno: Computer Press, 2008. ISBN 978-80-251-2025-5.
-
Pehlivanian, Ara. JavaScript okamžitě. Brno: Computer Press, 2021. ISBN 978-80-251-5025-2.
-
PŠENČÍKOVÁ, Jana. Algoritmizace. [s.l.] : [s.n.], 2007. 120 s. ISBN 80-86686-80-9..
-
SUEHRING, Steve a ZEMÁNEK, Jakub. JavaScript: krok za krokem. Brno: Computer Press, 2008. ISBN 978-80-251- 2241.
-
Wróblewski, Piotr. Algoritmy. Brno: Computer Press, 2015. ISBN 978-80-251-4126-7.
|