Course detail

Introduction to Programming Systems

FIT-IZPAcad. year: 2019/2020

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

Learning outcomes of the course unit

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

Prerequisites

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.

Co-requisites

Not applicable.

Recommended optional programme components

Not applicable.

Recommended or required reading

McConnell, S.: Code Complete, Microsoft Press, 2004, ISBN 0735619670.
Kernighan, B., W., Ritchie, D., M.: Programovací jazyk C, Computer Press, Brno, 2006, ISBN 80-251-0897-X.
Schildt, H.: Nauč se sám C, SoftPress s.r.o, Praha, 2001, ISBN 80-86497-16-X.
Soubor materiálů prezentovaných na přednáškách bude dostupný na WWW.
Herout, P.: Učebnice jazyka C, Kopp, České Budějovice, 2009, 6. vyd., ISBN 978-80-7232-383-8.
BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
Virius, M.: Jazyky C a C++, Grada Publishing, 2011, ISBN 978-80-247-3917-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.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

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

Language of instruction

Czech, English

Work placements

Not applicable.

Aims

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.

Specification of controlled education, way of implementation and compensation for absences


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

Classification of course in study plans

  • Programme BIT Bachelor's, 1. year of study, winter semester, 7 credits, compulsory

  • Programme IT-BC-3 Bachelor's

    branch BIT , 1. year of study, winter semester, 7 credits, compulsory

Type of course unit

 

Lecture

39 hours, optionally

Teacher / Lecturer

Syllabus


  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.

Exercise

12 hours, compulsory

Teacher / Lecturer

Syllabus

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

 

Computer exercise

20 hours, compulsory

Teacher / Lecturer

Syllabus


  1. Operating instructions, log in the intranet, registration at the laboratory, email instruction, news groups IZP, Unix for a 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. Control structures, strings and studio. Pointer type, storage allocation. File operations. Recursive problems solving. Matrix operations.

Projects

7 hours, compulsory

Teacher / Lecturer

Syllabus


  1. Basic program construction in C language.
  2. Recurrence problem-solving.
  3. Computations with matrixes.
  4. Project source code documentation.

eLearning