Course detail

Algorithms and Programming

FEKT-APRGAcad. year: 2012/2013

Basic concepts of programming, introduction to creating algorithms and students‘ own programs. Basic elements of a program, cycles, recursions. The programming environment Matlab and creating basic scripts and functions for solving simple problems. Work with the basic types of data, vectors, matrices, fields, chains. Basic algorithms of sequencing and searching. Introduction to an analysis of efficiency and optimization of algorithms.. Use of Matlab in specific areas (libraries of functions).

Language of instruction

Czech

Number of ECTS credits

4

Mode of study

Not applicable.

Guarantor

doc. Ing. Jana Kolářová, Ph.D.

Department

Department of Biomedical Engineering (UBMI)

Offered to foreign students

Of all faculties

Learning outcomes of the course unit

The ability to analyse and design simple algorithms for computers. To learn the fundamental conception of programming in Matlab. To learn how to create own scripts and functions and how to make use of the available libraries of functions. To master the terminology of programming, syntax and semantics of the programming language.

Prerequisites

Secondary-school knowledge of the study area.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

Requirements are specified by guarantor’s regulation updated for every academic year.

Course curriculum

Algorithm, program, programming language. The programming environment Matlab and its use. Basic algorithms, verification of the correctness of algorithms and their optimization.

Work placements

Not applicable.

Aims

To acquire the basic programming skills. Selected solved problems will be studied and the acquired knowledge will be used to create students‘ own programs. To learn how to solve the set mathematical problems using the students‘ own scripts and functions in the programming environment Matlab. To learn the types of data used in Matlab, how to load them, operate and how to present results. Recursive and non-recursive processing. To learn how to create functions for searching and basic methods of sequencing.

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

Extent and forms are specified by guarantor’s regulation and updated for every academic year.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Zaplatílek K, Doňar B: Matlab pro začátečníky, Technická literatura BEN, Praha 2003 (CS)
Zaplatílek K, Doňar B: Matlab tvorba uživatelských aplikací, Technická literatura BEN, Praha 2004 (CS)

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme BTBIO-A Bachelor's

    branch A-BTB , 1 year of study, summer semester, compulsory

  • Programme EEKR-CZV lifelong learning

    branch EE-FLE , 1 year of study, summer semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

Ing. Martin Vítek, Ph.D.

Syllabus

1. Programming, algorithm, program conception
2. An introduction to Matlab
3. An overview of the basic data structures and use of them
4. The basic program elements, cycles, recursions
5. Algorithmisation of numerical methods
6. Sequencing algorithms
7. Searching algorithms
8. Searching of texts
9. Analysis of program efficiency
10. Elimination of recursion and algorithm optimization
11. Advanced programming techniques
12. Matlab llibraries
13. Use of Matlab in other disciplines

Exercise in computer lab

26 hod., compulsory

Teacher / Lecturer

Ing. Martin Chrobák
Ing. Vratislav Čmiel, Ph.D.

Syllabus

1. The programming environment Matlab, parts, control
2. Work with the basic types of data, data loading, presentation of results
3. Basic mathematical problems, using the basic mathematical functions of Matlab
4. Practising the basic types of program branching, cycles in recursive problems
5. Creating scripts and functions
6. Creating simple data structures and work with elements
7. Design of simple functions for sequencing of elements by means of methods Select sort, Buble sort, Insert sort
8. Creating of a simple database, searching of texts
9. Individual projects, an outline of solutions, test (max 20 points)
10. Matlab graphical application interface Guide
11. Application of students‘ own functions to a simple graphic interface Guide
12. Submission and presentation of student work (max. 20 points)
13. Final test (max. 60 points), classified course-unit credit