IB053 Efficient Programming Methods

Faculty of Informatics
Spring 2020
Extent and Intensity
1/1/0. 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)
RNDr. Nikola Beneš, Ph.D. (assistant)
Guaranteed by
RNDr. Nikola Beneš, Ph.D.
Department of Computer Systems and Communications - Faculty of Informatics
Contact Person: Mgr. Petr Steinmetz
Supplier department: Department of Computer Systems and Communications - Faculty of Informatics
Timetable
Mon 8:00–8:50 A218
  • Timetable of Seminar Groups:
IB053/01: Mon 9:00–9:50 A215, P. Steinmetz
Prerequisites
Knowledge of programming at some of languages C, C++, Pascal, Delphi, Java, 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: 7/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
there are 56 fields of study the course is directly associated with, display
Course objectives
Purpose of this lecture is to forward knowledge 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 lecture is not algorithm design self in term of complexity.
Learning outcomes
At the end of course student gains knowledge and routine leading to more efficient creation of software including more efficient implementation od algorithm.
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. Programovací techniky [1985]. 1. vyd. Brno: Rektorát Vysokého učení technického v Brně, 1985. 357 s. info
Teaching methods
Lectures, seminars, homeworks
Assessment methods
The course has a form of lectures (not required attendance) with a seminar (required attendance, eventually according to agreement), including solving of projekt with support at seminar (independently or partly collective). The course is concluded by colloquium.
Language of instruction
Czech
Further comments (probably available only in Czech)
Study Materials
The course is taught annually.
The course is also listed under the following terms Spring 2003, Spring 2004, Spring 2005, Spring 2006, Spring 2007, Spring 2009, Spring 2010, Spring 2011, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2021.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/spring2020/IB053