doc. RNDr. Jitka Kreslíková, CSc.

Faculty of Information Technology (FIT)

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.

Not applicable.

Not applicable.

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/

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Evaluated home assignments with the defence (28 points). Computer practices (8 points). Mid-term written examination (12 points). Final written examination (55 points).

Czech

Not applicable.

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.
Recursion.
Pointer types and dynamic variables. Linked structures.
Sorting.
Searching.
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.

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.

• Programme BPC-AUD Bachelor's

  specialization AUDB-TECH , any year of study, winter semester, 6 credits, elective
  

• Programme BPC-AMT Bachelor's, any year of study, winter semester, 6 credits, elective
  
• Programme BPC-EKT Bachelor's, any year of study, winter semester, 6 credits, elective
  
• Programme BPC-IBE Bachelor's, any year of study, winter semester, 6 credits, elective
  
• Programme BPC-MET Bachelor's, any year of study, winter semester, 6 credits, elective
  
• Programme BPC-SEE Bachelor's, any year of study, winter semester, 6 credits, elective
  
• Programme BPC-TLI Bachelor's, any year of study, winter semester, 6 credits, elective
  

14 hours, optionally

doc. RNDr. Jitka Kreslíková, CSc.

eLearning: currently opened course