Course detail

Basics of Programming

FSI-SZPAcad. year: 2013/2014

An introduction to algorithmization utilizing the PASCAL programming language. Main topics of the subject are structure and properties of algorithms, Pascal commands, simple and stuctured data types, input and output, pointers and some sorting and searching techniques.

Language of instruction

Czech

Number of ECTS credits

4

Mode of study

Not applicable.

Guarantor

doc. RNDr. Libor Čermák, CSc.

Department

Institute of Mathematics (ÚM)

Learning outcomes of the course unit

Students will acquire basic skills in programming and algorithmization. Namely, they will master formulating a simple algorithm and implementing it in the PASCAL programming language. Acquired knowledge will be helpful for students to understand object oriented programming in Delphi environment, which is utilized in several following courses.

Prerequisites

Basic PC Computing skills, Windows OS.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

The course is taught through lectures explaining the basic principles and theory of the discipline. Exercises are focused on practical topics presented in lectures.

Assesment methods and criteria linked to learning outcomes

Classification reflects the quality of the semester assignment and test result.
FINAL ASSESSMENT: A (excellent): 100--90; B (very good): 89--80; C (good): 79--70; D (satisfactory): 69--60; E (sufficient): 59--50; F (failed): 49--0.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

The aim of the course is to familiarise students with Pascal programming language and the basics of algorithmization. Students will master algorithm development of practical problem and its realization utilizing the Pascal language. The course aims to guide students to the ability of an independent work in an appropriate programming environment so as they could deepen their knowledge depending on their individual needs. Moreover, students will learn to present obtained results of their single-handed projects.

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

Attendance at lectures is recommended, attendance at seminars is required. Lessons are planned according to the week schedules. Absence from lessons may be compensated by the agreement with the teacher supervising the seminars.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Not applicable.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme B3901-3 Bachelor's

    branch B-MAI , 1 year of study, winter semester, compulsory

Type of course unit

 

Lecture

13 hod., optionally

Teacher / Lecturer

doc. Ing. Petr Tomášek, Ph.D.

Syllabus

1. Introduction to programming. Structure and properties of algorithms.
2. Pascal basic statements.
3. Simple data types: Real, Boolean. Variables, constants and expressions.
4. Simple data types: Char, Interval and enumeration type.
5. Structured data types: Array and String.
6. Input and Output.
7. Structured data types: Record and Set.
8. Procedures and functions. Recursive algorithms.
9. File types.
10. Pointer types.
11. Dynamic data structures.
12. Basic searching and sorting algorithms.
13. Teacher's reserve.

Computer-assisted exercise

26 hod., compulsory

Teacher / Lecturer

doc. Ing. Petr Tomášek, Ph.D.

Syllabus

Exercises extend and deepen the subject-matter delivered in the respective lessons. Great emphasis is placed on the ability of an individual work in the Pascal environment, i.e. creating of an algorithm and its debugging. In every exercise at least one new project in Pascal will be created. The students will demonstrate the acquired knowledge and programming skills by elaborating semester assignments. The results of the assignment will be presented at the end of the semester.