University of Bialystok - Central Authentication System
Strona główna

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) Basic information on ECTS credits allocation principles:
  • the annual hourly workload of the student’s work required to achieve the expected learning outcomes for a given stage is 1500-1800h, corresponding to 60 ECTS;
  • the student’s weekly hourly workload is 45 h;
  • 1 ECTS point corresponds to 25-30 hours of student work needed to achieve the assumed learning outcomes;
  • weekly student workload necessary to achieve the assumed learning outcomes allows to obtain 1.5 ECTS;
  • work required to pass the course, which has been assigned 3 ECTS, constitutes 10% of the semester student load.

view allocation of credits
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 ++).

This course is not currently offered.
Course descriptions are protected by copyright.
Copyright by University of Bialystok.
ul. Świerkowa 20B, 15-328 Białystok tel: +48 85 745 70 00 (Centrala) https://uwb.edu.pl contact accessibility statement USOSweb 7.0.2.0-1 (2024-03-12)