I002 Design of Algorithms I

Faculty of Informatics
Spring 2001
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, Wed 18:00–19:50 D1
Prerequisites
! U212 Design of Algorithms for CS IV && (! I502 Algorithms I )
Taking on I065 Seminar on Design of Algorithms I together with this course is recommended. It is assumed that the students have no problems with coding simple algorithms in some functional and in some imperative language.
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
The subject of the study is basic data structures and algorithms.
Syllabus
  • Programming paradigms, expressions, commands, state.
  • Correctness of algorithms, preconditions, postconditions, partial correctness, convergence. Verification methods.
  • Growth of functions. Recurrences, summations.
  • Computation length, algorithm complexity, problem complexity.
  • Basic data structures (lists, trees, graphs, arrays).
  • Searching, search trees.
  • Sorting, lower bound of sorting algorithms. Quick Sort, Merge Sort, Heap Sort.
  • Combinatorial and graph algorithms. Shortest Path, Minimum Spanning Tree.
Literature
  • PARSONS, Thomas W. Introduction to algorithms in Pascal. New York: John Wiley & Sons. xiv, 447. ISBN 0471305944. 1995. info
  • CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press. xvii, 1028. ISBN 0070131430. 1989. 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
Further Comments
The course is taught annually.
Teacher's information
http://www.fi.muni.cz/usr/skarvada/vyuka/I002/
The course is also listed under the following terms Autumn 1995, Spring 1996, Autumn 1996, Spring 1997, Autumn 1997, Spring 1998, Spring 1999, Spring 2000, Spring 2002, Spring 2003.
  • Enrolment Statistics (Spring 2001, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2001/I002