Course details

Algorithms

IAL Acad. year 2006/2007 Summer semester 5 credits

Current academic year

Item has no anotation.

Guarantor

Honzík Jan M., prof. Ing., CSc. (DIFS)

Language of instruction

Czech, English

Completion

Examination

Time span

  • 39 hrs lectures
  • 13 hrs projects

Department

Department of Information Systems (UIFS)

Subject specific learning outcomes and competences

Item has no knowledges.

Learning objectives

Item has no goals.

Recommended prerequisites

Prerequisite knowledge and skills

There are no prerequisites

Study literature

  • Honzík, J., Hruška, T., Máčel, M.: Vybrané kapitoly z programovacích technik, Ed.stř.VUT Brno,1991.

Fundamental literature

  • Knuth, D.: The Art of Computer programming, Vol.1,2,3. Addison Wesley, 1968
  • Wirth, N.: Alorithms+Data Structures=Programs, Prentice Hall, 1976
  • Horovitz, Sahni: Fundamentals of Data Structures.
  • Amsbury, W: Data Structures: From Arrays to Priority Queues.
  • Cormen, T.H., Leiserson, Ch.E., Rivest, R.L.: Introduction to Algorithms.
  • Aho A.V., Hoppcroft J.E., Ullman J.D.: Data Structures and Algorithms.
  • Kruse, R.L.: Data Structures and Program Design. Prentice- Hall,Inc. 1984
  • Baase, S.: Computer Algorithms - Introduction to Design and Analysis. Addison Wesley, 1998
  • Sedgewick,R.:Algoritmy v C. (Základy. Datové struktury. Třídění. Vyhledávání.) Addison Wesley 1998. Softpress 2003.

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Controlled instruction

There are no checked study.

Back to top