FEL timetable ALG students Upload system BRUTE Discussion board

BE5B33ALG -- Algorithms

Course goals

The course is concerned with the ability to implement effectively solutions of various problems arising in elementary computer science. Main topics of the course include sorting and searching algorithms and related data structures. The course stresses correct algorithms choice and effective implementation as an unique tool for successful problems solving.

Informal prerequisites - Programming

The student of the course is expected to be capable of programming in at least one of the languages C/C++/Java/Python. Integral part of the seminaries are practical programming homeworks on algorithm topics. The student should be familiar with basic structures like arrays, lists, files and should be able to manipulate data stored in those structures.




Lectures and seminaries are taught by

Marko
Genyk-Berezovskyj
 
Groups:
courses/be5b33alg/start.txt · Last modified: 2017/02/22 10:30 by berezovs