Introduction to Programming Systems
IZP Acad. year 2020/2021 Winter semester 7 credits
Algorithms and problem solving: the strategy of problem-solving, structured decomposition, concept and features of the 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, the concept of pointers. Strategy for selecting an appropriate data structure. Recursion, the 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).
Language of instruction
Češka Milan, RNDr., Ph.D. (DITS FIT BUT)
Husa Jakub, Ing. (DCSY FIT BUT)
Hynek Jiří, Ing., Ph.D. (DIFS FIT BUT)
Iša Radek, Ing. (DCSY FIT BUT)
Klobučníková Dominika, Ing. (DIFS FIT BUT)
Malík Viktor, Ing. (DITS FIT BUT)
Očenášek Pavel, Mgr. Ing., Ph.D. (DIFS FIT BUT)
Pánek Richard, Ing. (DCSY FIT BUT)
Rozman Jaroslav, Ing., Ph.D. (DITS FIT BUT)
Rydlo Štěpán, Ing. (DITS FIT BUT)
Sakin Martin, Ing. (DITS FIT BUT)
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT)
Tinka Jan, Ing. (DITS FIT BUT)
Tomko Martin, Ing. (DIFS FIT BUT)
Trchalík Roman, Mgr., Ph.D. (DIFS FIT BUT)
Veigend Petr, Ing. (DITS FIT BUT)
Vondráček Martin, Ing. (DIFS FIT BUT)
Subject specific learning outcomes and competences
Student acquaints with the methods of analysing and designing simple computer algorithms. The fundamental concepts of programming languages will be introduced to the student. The student will learn how to write programs in high programming languages and how to understand and use the EBNF to describe programming language syntax. The student will also acquire basic English terminology of programming, syntax, and semantics of programming language. The student will be acquainted with testing principles of programs. The student will learn how to document, to present, and to defend the reached results.
Generic learning outcomes and competences
The student will learn the computer-aided solving of simple problems by elaborating projects. The student will learn to create the program documentation and defend the results of project solving.
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 the basic knowledge of data representation in the memory of the computer. 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.
Why is the course taught
After taking the Introduction to Programming Systems, the 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.
Prerequisite kwnowledge and skills
This course is placed in the winter term of the first year of the bachelor's study programme. Thus, we expect that students have the high school level knowledge of mathematics and using computers.
- 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.
- 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.
Syllabus of lectures
- Introduction to the arrangement of studying. Structure and goals of classes. 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 representation, labels.
- The concept of data. Simple data types. Expressions and statements.
- Control structures. Blocks, scope, and activation.
- Functions, parameters of functions.
- Programs debugging.
- Text files, standard input and output.
- Structured data types.
- Recursion in programming.
- Pointer types and dynamic variables. Linked structures.
- Advanced programs debugging, verification, validation and documentation of source code.
- The modular construction of program.
Syllabus of numerical exercises
- The elementary program development tools
- Programs compilation and running
- Simple programs in C language
- Data types, data types casting
- Control structures
- Functions, working with strings
- Basic debugging methods, debugging and profiling tools
- Programs input and output
- Working with memory
- Source code documentation, testing basics
- Modular programming, basics of plug-ins
Syllabus of computer exercises
- Operating instructions, log in the intranet, registration at the laboratory, email instruction, news groups IZP, Unix for a beginner, Dev C++ environment.
- 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. Control structures, strings and studio. Pointer type, storage allocation. File operations. Recursive problems solving. Matrix operations.
Syllabus - others, projects and individual work of students
- Basic program construction in C language.
- Recurrence problem-solving.
- Computations with matrixes.
- Project source code documentation.
- Evaluated home assignments with the defence - 26 points.
- Computer practices - 8 points.
- Mid-term written examination - 12 points.
- Final written examination - 54 points.
- 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. The minimal number of points which can be obtained from the final exam is 25. Otherwise, no points will be assigned to a student.
- The 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.
|Mon||lecture||lectures||E104 E105 E112||09:00||10:50||1BIB 2BIA 2BIB||xx|
|Mon||lecture||lectures||E104 E105 E112||13:00||13:50||1BIB 2BIA 2BIB||xx|
|Mon||comp.lab||lectures||N103 N104 N105||15:00||16:50||1BIA 1BIB 2BIA 2BIB||xx|
|Mon||comp.lab||lectures||N103 N104 N105||17:00||18:50||1BIA 1BIB 2BIA 2BIB||xx|
|Tue||comp.lab||lectures||N103 N104||08:00||09:50||1BIA 1BIB 2BIA 2BIB||xx|
|Tue||comp.lab||lectures||N103 N104||10:00||11:50||1BIA 1BIB 2BIA 2BIB||xx|
|Tue||comp.lab||lectures||N103 N104||16:00||17:50||1BIA 1BIB 2BIA 2BIB||xx|
|Tue||comp.lab||lectures||N103 N104||18:00||19:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||08:00||09:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||10:00||11:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||12:00||13:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||14:00||15:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||lecture||lectures||D0206 D105||16:00||17:50||1BIA 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||16:00||17:50||1BIA 1BIB 2BIA 2BIB||xx|
|Wed||comp.lab||lectures||N103 N104 N105||18:00||19:50||1BIA 1BIB 2BIA 2BIB||xx|
|Thu||comp.lab||lectures||N103 N104 N105||08:00||09:50||1BIA 1BIB 2BIA 2BIB||xx|
|Thu||lecture||lectures||D0206 D105||11:00||11:50||1BIA 2BIA 2BIB||xx|
|Thu||exercise||lectures||D0206 D105||12:00||12:50||1BIA 2BIA 2BIB||xx|
|Fri||comp.lab||lectures||N103 N104 N105||08:00||09:50||1BIA 1BIB 2BIA 2BIB||xx|
|Fri||comp.lab||lectures||N104 N105||10:00||11:50||1BIA 1BIB 2BIA 2BIB||xx|
|Fri||exercise||lectures||E104 E105 E112||13:00||13:50||1BIB 2BIA 2BIB||xx|
Course inclusion in study plans