FI:IB002 Algorithms I - Course Information

IB002 Design of Algorithms I

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

prof. RNDr. Tomáš Pitner, Ph.D. (lecturer)
RNDr. Libor Škarvada (lecturer)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Libor Škarvada

Timetable

Tue 10:00–11:50 D1, Tue 18:00–19:50 D1

Prerequisites

! I002 Algorithms I &&! I502 Algorithms I
Ability to read and write simple programs in at least one functional and one imperative programming language is required.

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

• Informatics (programme FI, B-IN)
• Informatics (programme FI, M-IN)
• Mathematics for Multi-Branches Study (programme PřF, B-MA)
• Mathematics (programme PřF, B-MA)
• Mathematics (programme PřF, B-MA)
• Profesional Mathematics (programme PřF, B-MA)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)

Course objectives

The course presents basic techniques of the analysis of algorithms, data structures, and operations. It is aimed at proving the correctness of algorithms and their efficiency. Basic algorithmic concepts and constructs are presented without any direct binding to a concrete programming language and without requirements of an immediate program implementation. The goal is to make the students know how to work with the algorithms themselves without any implementation details. It enables to present rather broad scope of techniques used in functional, imperative as well as object-oriented languages.

Syllabus

• Basic analysis of algorithms: Correctness of algorithms, input and output conditions, partial correctness, convergence, verification.
• The length of computation, algorithm complexity, problem complexity. Asymptotical analysis of time- and space complexity, the growth of functions, application of recursive relations in analysis of algorithms.
• Fundamental data structures: Lists, pushdown stacks, queues. Hashtables. Binary search trees, balanced trees, representation of sets.
• Sorting algorithms: quicksort, mergesort, heapsort, lower bound for complexity of sorting.
• Basic graph structures: Representation of graphs. Depth-first and breath-first traversal.

Literature

• SKIENA, Steven S. The algorithm design manual. New York: Springer, 1998, xvi, 486. ISBN 0387948600. info
• CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1989, xvii, 1028. ISBN 0070131430. info

Assessment methods (in Czech)

Kurs veden formou přednášek a je ukončen závěrečnou písemnou zkouškou.

Language of instruction

Czech

Follow-Up Courses

• I063 Algorithm Design II

Further Comments

The course is taught annually.

Listed among pre-requisites of other courses

• IB114 Introduction to Programming and Algorithms II
  (IB111 || IB113) && !IB002 && !NOW(IB002)  
• IV003 Algorithms and Data Structures II
  IB002 || program(PřF:N-MA)  
• IV100 Parallel and distributed computations
  IB002  
• MA015 Graph Algorithms
  IB002||(typ_studia(N)&&fakulta(fi))  

Teacher's information

http://www.fi.muni.cz/usr/skarvada/vyuka/IB002/

• Enrolment Statistics (Spring 2003, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2003/IB002