Mathematics BSc
Course description
2013.
Course description
2013.
Programming fundamentals
Hours lect+pc |
Credits lect+pc |
Assessment | Specialization | Course code lect/pc |
Semester | Status |
---|---|---|---|---|---|---|
2 + 2 | 2 + 3 | term grade | all | im1c1pn2 im1c2pn2 |
2 | compulsory |
Course coordinator
- László Zsakó
- Tibor Gregorics
Syllabus
- Problem solving strategies, foundations of problem solving in software technology. Software tools and methods for problem solving. Steps of problem solving. The procedure of programming, how to develop a program. Problems and solutions. Principles of program development. The origins of algorithmic and data structures, programming models. Tools for algorithmic notation.
- The notions of constants, variables, types. Basic and complex data, file handling. Integer and real numbers, boolean values, characters. The notion and usage of arrays, strings, records. Algorithmic structures. Basic algorithms for typical problems. The problems and solutions of: summation, decision, search, count, maximum, selection, sorting.
- Basic building blocks of a programming language (assignment, input, output, branches, loops, procedures, functions, constants, variables, types). Development Environment. Linking, compiling and running a program.