Basics of Programming - Algorithms
FEKT-BIZPAcad. year: 2015/2016
Algorithms and problem solving: strategy of problem solving, structured decomposition, concept and features of algorithm. Basic programming construction: syntax and semantics of high programming language, variables, type, assignment, control structures, procedure and functions, parameter passing, input/output, exceptional state processing. Basic data structure: simple data types, structured data typed: array, record, file, strings. Dynamic data structures, concept of pointers. Strategy for selecting appropriate data structure. Recursion, concept of recursion. Global and local variables. Simply recursion procedures. Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language. (ISO/IEC 9899: Programming languages - C).
Learning outcomes of the course unit
Student acquaints with the methods of analysing and designing simple computer algorithms. Student will introduced to the fundamental concepts of programming languages. Student gets up how to write programs in high programming languages. Student gets up how to use EBNF to describe programming language syntax. Student acquires basic English terminology of programming, syntax, and semantics of programming language.
The subject knowledge on the secondary school level is required.
Recommended optional programme components
Recommended or required reading
Herout, P.: Učebnice jazyka C, Kopp, České Budějovice, 2008, ISBN 978-80-7232-351-7.
The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
Kadlec, V.: Učíme se programovat v jazyce C, Computer Press, Praha, 2005, ISBN 80-7226-715-9.
Kernighan, B., W., Ritchie, D., M.: Programovací jazyk C, Computer Press, Brno, 2006, ISBN 80-251-0897-X.
Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
Prezentace přednášek: http://www.fit.vutbr.cz/study/courses/IZP/private/
Planned learning activities and teaching methods
Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.
Assesment methods and criteria linked to learning outcomes
Evaluated home assignments with the defence (28 points). Computer practices (8 points). Mid-term written examination (12 points). Final written examination (55 points).
Language of instruction
Properties of algorithms, notations for describing algorithms.
Problem solving techniques. Design and implementation of algorithms
Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers repesentation, labels.
The concept of data. Simple data types. Expression and statements.
Control structures. Blocks, scope and activation.
Functions, parameters of functions.
Text file standard input and output.
Structured data types.
Pointer types and dynamic variables. Linked structures.
Program verification, debugging, documentation.
To grasp an analysis of problems and to determine basic algorithms for their solving. To acquaint oneself with principles and features of high programming language and to possess them for implementing of algorithms. To learn how to use tools for program debugging. To get basic knowledge of data representation in memory. To make the acquaintance of evaluate algorithm complexity. To make the acquaintance of testing principles of programs. To possess active basic algorithms. To learn how to document, present and defend the reached results.
Specification of controlled education, way of implementation and compensation for absences
The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.
Type of course unit
39 hours, optionally
Teacher / Lecturer
Exercise in computer lab
12 hours, optionally
Teacher / Lecturer
The other activities
14 hours, optionally
Teacher / Lecturer
eLearning: currently opened course