Lecturer(s)
|
-
Semeniuk Martin, doc. Ing. Ph.D.
-
Vít Čestmír, Ing.
-
Veber Jan, doc. Ing. Ph.D.
-
Šípal Laurent, doc. Ing. CSc.
-
Neupauer Yevgeniy, doc. Ing. Ph.D.
-
Holý Richard, Ing. Bc. Ph.D.
|
Course content
|
The course provides students overview of the following areas: software and hardware, programming languages in general, object-oriented programming language of the 3rd generation, data processing in the mathematical field. 1. Introduction, credit and exam conditions, recommended literature, e-learning courses, algorithms, flowcharts 2. Programming languages in general, procedural programming language, basic terms, intuitive example, standard types of integer, real, char, boolean, string, one-dimensional array type 3. Basic commands, division, simplified input and output commands 4. Assignment command, compound command, conditional command, cycle commands, jump, empty command 5. Examples of algorithmization (flowcharts) 6. Examples of algorithmization (flowcharts) 7. Procedures and functions, parameters of procedures and functions, recursion, block structure, global and local variables, user units 8. User-defined types - enumerated, interval, set, field and record, work with matrices 9. Files, types of files, working with files, procedures and functions for working with files, detailed work with output formats 10. Solving of examples 11. Solving of examples 12. Computer hardware, new tools and applications 13. Reserve, test questions, pre-term
|
Learning activities and teaching methods
|
Lecture with practical applications, E-learning, One-to-One tutorial, Seminar classes, Individual study
- Contact hours
- 52 hours per semester
- Preparation for formative assessments (2-20)
- 16 hours per semester
- Preparation for an examination (30-60)
- 36 hours per semester
|
prerequisite |
---|
Knowledge |
---|
understand what mathematical logic is |
know the properties of integers and real numbers and operations with them |
Skills |
---|
be able to work with MS Office tools (Word, Excel) |
be able to work with PC |
be able to think logically |
learning outcomes |
---|
Knowledge |
---|
know what an algorithm is, its properties and possibilities of its description, resp. display |
know the basic features of the 3rd generation programming language |
know what structured and object-oriented programming is |
Skills |
---|
create a simple form application in an object-oriented programming system |
create simple algorithms for technical calculations, including work with arrays |
express the algorithm graphically |
be able to write to and read from a file |
teaching methods |
---|
Knowledge |
---|
E-learning |
Individual study |
One-to-One tutorial |
Interactive lecture |
Seminar classes |
Skills |
---|
Multimedia supported teaching |
Task-based study method |
assessment methods |
---|
Knowledge |
---|
Combined exam |
Test |
Skills |
---|
Skills demonstration during practicum |
Recommended literature
|
-
Bory, Pavel. C# bez předchozích znalostí. 1. vydání. 2016. ISBN 978-80-251-4686-6.
-
Hořejší, Petr. Základní technické vybavení počítače. [Plzeň] : SmartMotion, 2013. ISBN 978-80-87539-47-7.
-
Kopeček, Pavel. Algoritmizace a její počítačová podpora. [Plzeň] : SmartMotion, 2013. ISBN 978-80-87539-45-3.
-
Sharp, John. Microsoft Visual C# Step by Step (9th Edition). Pearson Education, Inc., 2018. ISBN 978-1509307760.
|