Programming I. - KMEPR1EBNF
Academic year/semester: 2024/25/2
ECTS Credits: 6
Available for: All OU students
Lecture hours: 1
Seminarium:0
Practice: 2
Laboratory: 0
Consultation: 0
Prerequisites: -
Course Leader: Dr. Károly János Bretz
Faculty: Kandó Kálmán Faculty of Electrical Engineering, 1084 Budapest, Tavaszmező utca 17.
Course Description:
Competences:
-
Topics:
Requirements system, presentation of materials to download. Programming languages. C language structure. Introduction to the C development environment. Variable types, declarations, value assignments. Arithmetic operators, bit operators. Arithmetic operations, bit operations. Evaluation rule. Writing, compiling, running a program, debugging a program, breakpoint. Checking results in the WATCHES window
Definition of algorithm. Logical evaluation, logical operators, condition checking, branch instructions.
Logical operators, condition checking, branch instructions.
Loops 1, loop entry and loop stay conditions. Single cycles without condition, complex condition. Pl.1:
Pl.2: multiple nested loops. Cycles 2, cycle+in-cycle condition check (e.g.: divisibility, bit check, digit check), Check results in WATCHES window
Functions 1. Function concept, \\\"black box\\\". Factory functions and eigenfunctions. Eigenfunctions with parameter passing by value, return value. Eigenfunctions with same and different types of input parameters, same and different types of return values.
Functions 2. Formatted printout to screen, formats, printf(). Problem processing, decomposition, solution, verification.
Arrays 1, Arrays, mathematical concept of an array. Different types of arrays, their characteristics.
Declaration, Numeric and character arrays. Array element reference, array element reading, array element writing. Using arrays in C language, index referencing in main() main function. Use of arrays with index reference in a private function, with parameter passing by value and return value.
Arrays 2, POINTERS, Use of arrays with address reference in a callback function.
Algorithms. Algorithms implemented in eigenfunctions on array values with pointers.
Algorithms. Algorithms implemented in eigenfunctions on array values with pointers.
ZH sample solutions, consultation.
Assessment: Completion of two combined theoretical-practical final examinations at at least satisfactory level.
Exam Types:
Mid Term Exam
Compulsory bibliography: Aids issued by the trainers.
Recommended bibliography: -
Additional bibliography: -
Additional Information: -