Algorithms and Data Structures
General data
Course ID: | 0900-FX1-3ASD |
Erasmus code / ISCED: | (unknown) / (unknown) |
Course title: | Algorithms and Data Structures |
Name in Polish: | Algorytmy i struktury danych |
Organizational unit: | Faculty of Physics |
Course groups: | |
ECTS credit allocation (and other scores): |
(not available)
|
Language: | Polish |
Type of course: | obligatory courses |
Requirements: | (in Polish) Programowanie strukturalne 0900-FG1-1PS |
Mode: | (in Polish) w sali |
Full description: |
1. Notations of algorithms. 2. Data structures and algorithms - overview. 3. Arrays. Computational complexity. 4. Simple sorting algorithms. 5. Stacks and Queues. 6. Linked Lists. 7. Recursion. 8. Advanced sorting algorithms. 9. Binary Trees. 10. Heap. 11. Balanced Binary Trees. 12. Non Binary Trees. 13. Hash Tables. 14. Graph. 15. STL containers. |
Bibliography: |
1. Rober Lafore – „Data Structures and Algorithms”, (ISBN: 0-672-31633-1). 2. Adam Drozdek – Data Structures and Algorithms in C++”. |
Learning outcomes: |
(in Polish) 1. Potrafi przedstawiać algorytmy w postaci: listy kroków, schematów blokowych, schematów zwartych NS. 2. Potrafi określić złożoność obliczeniową prostych programów. 3. Potrafi korzystać z prostych narzędzi (np.: JavaBlock) wspomagających projektowanie algorytmów. 4. Potrafi wykorzystywać rekurencję, rozumiejąc jej mocne i słabe strony. 5. Potrafi programować i wykorzystywać klasy (w C++) implementujące interfejsy popularnych struktur danych takich jak: tablice, stosy, kolejki, listy, drzewa, grafy. 6. Umie projektować i wykorzystywać różne algorytmy sortowania. |
Assessment methods and assessment criteria: |
After completion of training of the subject Structures and Algorithms Data is written exam, which verifies obtained knowledge. The final grade consists of the result of credit laboratory and the result of the written examination. Laboratory assessment is based on: the presence, activity and result of credit laboratory in one of the forms (to be chosen by the student): I. Exam at the computer includes selected issues of material laboratory (to solve the problem by writing or modifying the algorithm in C ++). II. The project (to solve one of the given problems by writing or modifying the algorithm in C ++). |
Copyright by University of Bialystok.