Algorithms and data structures 1000-213bASD
Basic principles of analysis of algorithms.
Methods for designing efficient algorithms.
Sorting.
Selection.
Priority queues.
Searching and dictionaries.
Find-Union problem and its applications.
Graph algorithms.
Text pattern matching.
Data structures for text processing.
Type of course
Requirements
Course coordinators
Bibliography
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-53196-8.
Additional information
Information on level of this course, year of study and semester when the course unit is delivered, types and amount of class hours - can be found in course structure diagrams of apropriate study programmes. This course is related to the following study programmes:
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: