Algorithms

Garant předmětu:

Přednášející:

Cvičící:

Předmět zajišťuje:

katedra kybernetiky

Anotace:

In the course, the algorithms development is constructed with minimum dependency to programming language; nevertheless the lectures and seminars are based on Java. Basic data types a data structures, basic algorithms, recursive functions, abstract data types, stack, queues, trees, searching, sorting, special application algorithms. Students are able to design and construct non-trivial algorithms and to evaluate their affectivity.

Výsledek studentské ankety předmětu je zde: http://www.fel.cvut.cz/anketa/aktualni/courses/AE4B33ALG

Požadavky:

Programming 1

Osnova přednášek:

1. Algorithms, programs, programming languages, introduction to problems solving

2. One-dimensional array, simple problems v 1-D array

3. Sorting in 1-D array pole (mergesort, quicksort, heapsort),

4. Searching in 1-D array

5. 2-D array, simple tasks in 2-D array

6. Strings, simple problems in string processing, text files

7. Asymptotic complexity, evaluation of space and complexity of algorithms from lectures No. 3.-6.

8. Simple recursion, recursive functions, advanced techniques

9. File conception, sequential files, conception of the record, file of records

10. Data types, list, stack, queue, examples of application

11. Linked lists, linearly-linked list, other types of linked list, trees

12. Trees, their properties, binary trees, basic algorithms of tree search.

13. Basic algorithms of linear algebra and mathematical analysis

14. Reserve

Osnova cvičení:

1.Introductory test, repeating of the ways of program construction in development environment, examples of functions and procedures, parameters, simple classes, assignment of semester task

2.One-dimensional array processing

3.Sorting and searching in 1D array algorithms

4.Multidimensional array processing algorithms

5.Text and string algorithms

6.Experimentation with space and complexity of algorithms

7.Sequential files

8.Implementation of abstract data types

9.Recursion and iteration

10.Linked lists, linearly-linked list

11.Tree construction, tree search

12.Test, consultation to semester task

13. Algorithms of linear algebra and geometry, mathematical analysis

14.Credit

Cíle studia:

Semester project consists from empirical evaluation of searching and sorting algorithms, comparison of iterative and recursive algorithms and debugging of graphical output of selected algorithms of linear algebra and mathematical analysis. Three phases of supervision associated to constituted subtask of project with closing demonstration and defense

Studijní materiály:

[1] Sedgewick, R: Algorithms (Fundamentals, Data structures, Sorting,

Searching), Addison Wesley, 2003

[2] Weiss, M: Data structures and Algorithm Analysis in Java, Addison Wesley, 1999

[3] Keogh, J: Data Structures Demystified, McGraw-Hill, 2004

[4] Wróblevski, P: Algorytmy, Helion, 2003

Poznámka:

Rozsah výuky v kombinované formě studia: 14p+6c

Další informace:

http://cw.felk.cvut.cz/doku.php/courses/ae4b33alg

Pro tento předmět se rozvrh nepřipravuje

Předmět je součástí následujících studijních plánů: