Bi3011 Algorithmization and programming

Faculty of Science
Spring 2008
Extent and Intensity
2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: k (colloquium).
Teacher(s)
RNDr. Jaroslav Ráček, Ph.D. (lecturer)
RNDr. Miroslav Kubásek, Ph.D. (lecturer)
Guaranteed by
prof. RNDr. Jiří Hřebíček, CSc.
RECETOX – Faculty of Science
Contact Person: doc. Ing. Daniel Schwarz, Ph.D.
Timetable
Fri 9:00–12:50 F01B1/709
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
This course is oriented on the adoption of theoretical and practical knowledge, activities related to development and usage of algorithms; well structured programs including principles of their functions and complexity of work with data. The course comes out from functional programming paradigm and aims to an explanation and a good exploitation of adequate methods during the program design phase. Students will gain necessary knowledge and skills for designing an algorithm which solves a given problem; coding this algorithm in a programming language and debugging the algorithm to check its functionality. The course is taught with the aid of programming languages Pascal and Maple.
Syllabus
  • Algorithm, decomposition of algorithm, loops, conditional statement Data types Programming language Pascal – structure of the language, commands Subprograms – procedures and functions Examples of simple algorithm working with an array Searching algorithms Sorting algorithms (BubleSort, MaxSort, QuickSort) Matrixes Recursive algorithms Numerical algorithms for definite integrals Maple system, structure, mathematical operation with sets, sequences, vectors and matrixes, equations, 2D and 3D graphs. Examples and constructions of simple algorithms working with mathematical structures (procedures and modules) Visualization of outputs in Maple, creation of 2D and 3D graphs, animations Solving of chosen mathematical problems in Maple with usage of libraries (packages) Connectivity in Maple, exploitation of algorithms and data from the Internet sources Time complexity, space complexity, examples of optimalization
Literature
  • Buchalcevová, A.: Algoritmizace a programování. Praha: VŠE, 1994.
  • Topfer, P.: Algoritmy a programovací techniky. Praha: Prometheus, 1995.
  • Drbal, P.: Úvod do programování s využitím jazyka Pascal. Praha: VŠE 1998.
  • Kvoch, M.: Programování v Turbo Pascalu 7.0. České Budějovice: KOPP 1995.
  • Virius, M.: Základy algoritmizace. Praha: ČVUT, 1997.
  • Hřebíček, J., Žák Vladimír: Maple v příkladech, Praha: Grada, 2007.
  • Hřebíček, J.: Úvod do systému Maple Brno: FI MU, 2004.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is also listed under the following terms Spring 2008 - for the purpose of the accreditation, Spring 2011 - only for the accreditation, Spring 2009, Spring 2010, Spring 2011, Spring 2012, spring 2012 - acreditation, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022.
  • Enrolment Statistics (Spring 2008, recent)
  • Permalink: https://is.muni.cz/course/sci/spring2008/Bi3011