Faculty of Information Technology, BUT

Course details

Introduction to Programming Systems

IZP Acad. year 2019/2020 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)

Guarantor

Deputy Guarantor

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

39 hrs lectures, 12 hrs exercises, 20 hrs pc labs, 7 hrs projects

Assessment points

54 exam, 12 half-term test, 8 exercises, 26 projects

Department

Lecturer

Instructor

Beníčková Zuzana, Ing. (DIFS FIT BUT)
Češka Milan, RNDr., Ph.D. (DITS FIT BUT)
Husa Jakub, Ing. (DCSY FIT BUT)
Hynek Jiří, Ing. (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)
Trchalík Roman, Mgr., Ph.D. (DIFS FIT BUT)
Veigend Petr, Ing. (DITS 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.

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 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.

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.

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.

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 representation, 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. The 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 - 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.

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.

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.

Exam prerequisites

  • 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.

Schedule

DayTypeWeeksRoomStartEndLect.grpGroupsInfo
Moncomp.lablectures N105 08:0009:50 1BIB 32 Asistent ???
Moncomp.lablectures N104 08:0009:50 1BIB 31 Asistent Veigend
Moncomp.lablectures N103 08:0009:50 1BIB 30 Asistent ???
Monlecturelectures D0206 D105 09:0010:50 1BIA 2BIA 2BIB xx
Moncomp.lablectures N105 10:0011:50 1BIB 35 Asistent ???
Moncomp.lablectures N104 10:0011:50 1BIB 34 Asistent Veigend
Moncomp.lablectures N103 10:0011:50 1BIB 33 Asistent ???
Moncomp.lablectures N103 N104 N105 12:0013:50 1BIA 1BIB xx Volné využití
Monlecturelectures D0206 D105 13:0014:50 1BIB 2BIA 2BIB xx
Moncomp.lablectures N104 15:0016:50 1BIB 37 Asistent Očenášek
Moncomp.lablectures N103 15:0016:50 1BIB 36 Asistent Hynek
Moncomp.lablectures N105 15:0016:50 1BIB 38 Asistent Trchalík
Moncomp.lablectures N103 17:0018:50 1BIB 39 Asistent Hynek
Moncomp.lablectures N105 17:0018:50 1BIB 41 Asistent ???
Moncomp.lablectures N104 17:0018:50 1BIB 40 Asistent Očenášek
Tuecomp.lablectures N103 N104 08:0009:50 1BIA 10 11 Asistent ???
Tuecomp.lablectures N103 N104 10:0011:50 1BIA 12 13 Asistent ???
Tuelecturelectures D0206 D105 12:0012:50 1BIA 2BIA 2BIB xx
Tuecomp.lablectures N103 N104 16:0017:50 1BIA 14 15 Asistent ???
Tuecomp.lablectures N103 N104 18:0019:50 1BIA 16 17 Asistent ???
Wedcomp.lablectures N103 N104 N105 08:0009:50 1BIA 18 19 20 Asistent ???
Wedcomp.lablectures N103 N104 N105 10:0011:50 1BIA 1BIB xx Volné využití
Wedexerciselectures D0207 D105 11:0011:50 1BIA 2BIA 2BIB xx 10 - 29
Wedcomp.lablectures N103 N104 N105 12:0013:50 1BIB 42 43 44 Asistent ???
Wedcomp.lablectures N103 N104 N105 14:0015:50 1BIA 1BIB xx Volné využití
Wedcomp.lablectures N103 N104 N105 16:0017:50 1BIA 21 22 23 Asistent ???
Wedcomp.lablectures N103 N104 N105 18:0019:50 1BIA 24 25 26 Asistent ???
Thucomp.lablectures N103 08:0009:50 1BIA 27 Asistent ???
Thucomp.lablectures N104 08:0009:50 1BIA xx rezerva
Thulecturelectures E104 E105 E112 09:0009:50 1BIB 2BIA 2BIB xx
Thuexerciselectures E104 E105 E112 10:0010:50 1BIB 2BIA 2BIB xx 30 - 44
Thucomp.lablectures N103 N104 10:0011:50 1BIA 28 29 Asistent ???
Thucomp.lablectures N103 18:0019:50 2BIA 2BIB xx Asistent ??? (tpl 45)

Course inclusion in study plans

  • Programme BIT, 1st year of study, Compulsory
  • Programme IT-BC-3, field BIT, 1st year of study, Compulsory
Back to top