|
Lecturer(s)
|
|
|
|
Course content
|
Algorithm Analysis Basic Data Structures Search and sort algorithms Operations on data structures Applications for LEGO robotic sets, work with mobile platforms (iOS or Android)
|
|
Learning activities and teaching methods
|
|
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Work with text (with textbook, with book), Methods of individual activities
|
|
Learning outcomes
|
The aim of subject is to inform student of basic ideas within sphere of analysis and design of algorithms.
Student will be able to apply introduced properties on practical examples and student will be able to record procedure of solution both in pseudo code and in the form of flowchart.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written examination, Home assignment evaluation, Student performance assessment
Assignment is conditional to the following requirements: - active participation to seminars - completion and submission of all the tasks set by the tutor at each seminar. The final examination consists of written part. The oral examination might also be considered.
|
|
Recommended literature
|
-
Lawler, A. Combinatorial Optimization. New York, 2001.
-
Levitin, Anany. Introduction to the design and analysis of algorithms. Boston: Addison-Wesley, 2003. ISBN 0-201-74395-7.
|