Introduction to Programming Systems

Language of Instruction:Czech
Public info:http://www.fit.vutbr.cz/study/courses/IZP/public/
Completion:credit+exam (written)
Type of
Guarantor:Kreslíková Jitka, doc. RNDr., CSc. (DIFS)
Deputy guarantor:Smrčka Aleš, Ing., Ph.D. (DITS)
Lecturer:Kreslíková Jitka, doc. RNDr., CSc. (DIFS)
Smrčka Aleš, Ing., Ph.D. (DITS)
Instructor:Češka Milan, RNDr., Ph.D. (DITS)
Havlena Vojtěch, Ing. (DITS)
Hruška Martin, Ing. (DITS)
Husa Jakub, Ing. (DCSY)
Iša Radek, Ing. (DCSY)
Malík Viktor, Ing. (DITS)
Matyáš Jiří, Ing. (DITS)
Očenášek Pavel, Mgr. Ing., Ph.D. (DIFS)
Pánek Richard, Ing. (DCSY)
Regéciová Dominika, Ing. (DIFS)
Rozman Jaroslav, Ing., Ph.D. (DITS)
Smrčka Aleš, Ing., Ph.D. (DITS)
Trchalík Roman, Mgr., Ph.D. (DIFS)
Veigend Petr, Ing. (DITS)
Wrona Jan, Ing. (DCSY)
Zobal Lukáš, Ing. (DIFS)
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Algorithms (IAL), DIFS
Substitute for:
Algorithms and Programming (APR), DIFS
Learning objectives:
  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 computers memory. To make the acquaintance of testing principles of programs. To possess active basic algorithms. To learn how to document, to present, and to defend the reached results.
  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, types, expressions, control structures, procedures and functions, parameter passing, input/output, exceptional state processing. Basic data structures: simple data types, structured data types: array, record, file, strings. Dynamic data structures, concept of pointers. Strategy for selecting appropriate data structure. Recursion, concept of recursion. Global and local variables. Simple recursive functions (procedures). Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language. (ISO/IEC 9899:1999 Programming languages - C)
Knowledge and skills required for the course:
  This course is placed in the winter term of the first year of the bachelors study programme. Thus, we expect that students have the high school level knowledge of mathematics and using computers.
Subject specific learning outcomes and competencies:
  Student acquaints with the methods of analysing and designing simple computer algorithms. The fundamental concepts of programming languages will be introduced to the student. Student will learn how to write programs in high programming languages and how to understand and use the EBNF to describe programming language syntax. Student will also acquire basic English terminology of programming, syntax, and semantics of programming language. Student will acquainted with testing principles of programs. Student will learn how to document, to present, and to defend the reached results.
Generic learning outcomes and competencies:
  Student will learn the computer-aided solving of simple problems by elaborating projects. Student will learn to create the program documentation and defend the results of project solving.
Why is the course taught:
  After taking the Introduction to Programming Systems, student should be able to understand the basic notions, algorithms, and principles of high level programming languages. A student will have a good skill of the programming and debugging in C language. The knowledge can be used in various areas of software development.
Syllabus of lectures:
  1. Introduction to the arrangement of studying. Structure and goals of classes. Properties of algorithms, notations for describing algorithms.
  2. Problem solving techniques. Design and implementation of algorithms.
  3. Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers repesentation, labels.
  4. The concept of data. Simple data types. Expressions and statements.
  5. Control structures. Blocks, scope, and activation.
  6. Functions, parameters of functions.
  7. Programs debugging.
  8. Text files, standard input and output.
  9. Structured data types.
  10. Recursion in programming.
  11. Pointer types and dynamic variables. Linked structures.
  12. Advanced programs debugging, verification, validation and documentation of source code.
  13. Modular construction of program.
Syllabus of numerical exercises:
Demonstration lessons:
  1. The elementary program development tools
  2. Programs compilation and running
  3. Simple programs in C language
  4. Data types, data types casting
  5. Control structures
  6. Functions, working with strings
  7. Basic debugging methods, debugging and profiling tools
  8. Programs input and output
  9. Recursion
  10. Working with memory
  11. Source code documentation, testing basics
  12. Modular programming, basics of plug-ins


Syllabus of computer exercises:
  1. Operating instructions, log in intranet, registration at laboratory, email instruction, news groups IZP, Unix for beginner, Dev C++ environment.
  2. Next seminars correspond to the content of individual lectures and demonstrate the presented topics. Defences of 3 projects. Computer practises contents: Making of programs, functions. Controll structures, strings and stdio. Pointer type, storage allocation. File operations. Recurzive problems solving. Matrix operations.
Syllabus - others, projects and individual work of students:
  1. Basic program construction in C language.
  2. Recurrence problem solving.
  3. Computations with matrixes.
  4. Project source code documentation.
Fundamental literature:
  • Herout, P.: Učebnice jazyka C, Kopp, České Budějovice, 2009, 6. vyd., ISBN 978-80-7232-383-8.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937.
  • BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5. 
  • 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.
  • Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937. 
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
  • Schildt, H.: Teach Yourself C, McGraw-Hill Companies, 2001.
Study literature:
  • McConnell, S.: Code Complete, Microsoft Press, 2004, ISBN 0735619670.
  • Kernighan, B. W.: The Practice of Programming, ADDISON-WESLEY, 2003, ISBN 020161586X.
  • Teaching materials available on WWW.
Controlled instruction:
  • Realisation and delivery of 3 home assignments.
  • Demonstration of home assignments during computer practises.
  • 10 computer practices.
  • Delivered and controlled the source code documentation of one project.
  • Mid-term written test.
  • Final written examination.
Progress assessment:
  • Evaluated home assignments with the defence - 26 points.
  • Computer practices - 8 points.
  • Mid-term written examination - 12 points.
  • Final written examination - 54 points.
Exam prerequisites:
  • Student has to get at least 20 of the points from the projects, practise and mid-term test for receiving the credit and then for entering the final exam.
  • Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

Your IPv4 address: