FI:IB053 Efficient Programming Methods - Course Information
IB053 Efficient Programming Methods
Faculty of InformaticsSpring 2007
- Extent and Intensity
- 1/1. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: z (credit).
- Teacher(s)
- Mgr. Petr Steinmetz (lecturer)
- Guaranteed by
- prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics
Contact Person: Mgr. Petr Steinmetz - Timetable
- Fri 7:00–8:50 B410, Fri 8:00–9:50 B311
- Prerequisites
- ! I053 Efficient Programming Methods
Knowledge of programming at some of languages C, C++, Pascal, Delphi, Java, J++, C#; knowledge of object oriented programming; basic awareness of machine code - Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
The capacity limit for the course is 40 student(s).
Current registration and enrolment status: enrolled: 0/40, only registered: 0/40, only registered with preference (fields directly associated with the programme): 0/40 - fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Informatics with another discipline (programme FI, B-BI)
- Informatics with another discipline (programme FI, B-FY)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-MA)
- Informatics with another discipline (programme FI, B-SO)
- Informatics with another discipline (programme FI, B-TV)
- Informatics (programme FI, B-IN)
- Course objectives
- Purpose of this speciality is to forward knowledges and experiences needed to development of software. A term "efficient programming" is here meant in two sense. Partly as work expended on creation of program that is to be efficient as possible and partly as program self whose implementation is also to be efficient as possible, i.e. so that computer while performs program makes minimum overhead (noneffective activity). Subject of speciality is not algorithm design self in term of complexity.
- Syllabus
- Work efficiency in algorithm design. Cutback of error rate in program creation. Cutback of time needed to elimination of mistakes. Usage of earlier written parts of programs. Independence of program from later changes. Portability of program to other environment. Program efficiency. Data access mechanism. Implementation of program structures. Difference in interpreted and compiled languages.
- Literature
- HONZÍK, Jan M. Programovací techniky. 1. vyd. Brno: Rektorát Vysokého učení technického v Brně, 1985, 357 s. info
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Teacher's information
- http://www.fi.muni.cz/~petr/ib053/
- Enrolment Statistics (Spring 2007, recent)
- Permalink: https://is.muni.cz/course/fi/spring2007/IB053