Fundamentals of Structural Programming

Studijní plán: Aplikovaná informatika - kombi, platný od ZS 2019/2020

Předmět Fundamentals of Structural Programming (ZSPa)
Garantuje Katedra technických studií (KTS)
Garant doc. Ing. Karel Richta, CSc.
Jazyk anglicky
Počet kreditů 5
Ekvivalent
Prezenční studium
Přednáška2 h
Cvičení2 h
Kombinované studium
Tutoriál / přednáška6 h
Cvičení8 h
Studijní plán Typ Sem. Kred. Ukon.
Aplikovaná informatika - kombi, platný od ZS 2019/2020 P 1 5 kr. Z,ZK
Aplikovaná informatika - kombi, platný od ZS 2021/2022 P 1 5 kr. Z,ZK
Aplikovaná informatika - platný od ZS 2019/2020 P 1 5 kr. Z,ZK
Aplikovaná informatika - platný od ZS 2021/2022 P 1 5 kr. Z,ZK
Erasmus - Aplikovaná informatika - příjezd na krátkodobý studijní pobyt PV 1 5 kr. Z,ZK

Anotace

The course is an introduction to algorithmization and fundamentals of programming in C language. The use of a procedural approach is emphasized and the student learns the principles of procedural programming, how to work with data types, language expressions and commands, the principle of calling functions and passing parameters. Acquired skills should be used to solve particular tasks. Students can divide a problem into sub-problems and solve it with a system of procedures (functions) in the given programming language.

 

Cíle výuky

Acquired knowledge: Student is able to use structured approach for problem solving and express solutions in C.  

Acquired skills: Student is able to use structured approach in solving specific tasks. It can divide a problem into subproblems and solve it by a system of procedures (functions) in a given programming language. 
 
Competencies: Student can program basic and intermediate algorithms in the C programming language.

Struktura předmětu

  • Algorithm, program, flowchart. Introduction to programming languages, compilers. 
  • Data representation in computer memory, basic data types, variables, constants, casting. 
  • Operators and their priority, expressions. Basic commands. 
  • Program runtime control – control structures. 
  • Decomposition of the problem into subproblems, procedural approach, recursion. 
  • Features and procedures.  
  • Structured data types. 
  • Pointers, dynamic memory allocation, parameter passing by value and reference. 
  • Input/output function, work with files. 
  • Search and sorting algorithms, introduction to algorithm complexity 

Sylabus

  • Algorithm, program, flowchart. Introduction into programming languages, compilers.
  • Data representation in the computer memory, basic data types, variables, constants, type conversion.
  • Operators and their priority, expressions.
  • Basic commands.
  • Running control of the program - control structures.
  • Decomposing a problem into sup-problems, procedural approach, recursion.
  • Functions and procedures.
  • Structured data types.
  • Index, dynamic memory allocation, parameter passing by value and link.
  • Input/output function, work with files.
  • Algorithms for searching and sorting, introduction to the complexity of algorithms.

Doporučená literatura

  • HEROUT, P.: Učebnice jazyka C – 2. díl, 4 vyd., České Budějovice: KOPP, 2008.
  • HEROUT, P.: Učebnice jazyka C. 6. vyd. České Budějovice: Kopp, 2009, 271, viii s. ISBN 978-80-7232-383-8.
  • WIRTH, N.: Algorithms data structures=programs. Englewood Cliffs, N.J.: Prentice-Hall, 1976, 366 p. ISBN 01-302-2418-9.
  • VIRIUS, M.: Základy algoritmizace. 1. vyd. Praha: České vysoké učení technické, 1995. ISBN 80-010-1346-4.
  • KLEMENS, B.: 21st Century C: C Tips from the New School, O'Reilly, 2014.
  • KERNIGHAN, B.W., RITCHIE, D.M.: The C Programming Language. Prentice-Hall, 2012.

^ nahoru ^