Abstract data structures (wykład) - 2019/2020

Course description
General information
Lecturer:dr Henryk Malinowski
Organising unit:Faculty of Natural Sciences and Health - Instytut Matematyki, Informatyki i Architektury Krajobrazu
Number of hours (week/semester): 2/30
Language of instruction:Język polski
Course objective
Prerequisites
Learning outcomes
Teaching method
Course content description
[Dr Henryk Malinowski - 2011/12]
COURSE CONTENTS:
Template class and template function. Stack and Reverse Polish Notation. Queue and examples of its uses. One and two-way list, sorted. STL library. The trees, binary search trees (BST). Operations on trees. Balancing trees. The uses of trees. Heaps - priority queues, heapsort. Hash tables and searching for information.
Forms of assessment
Required reading list
REQUIRED READING:
1. L. Banachowski, K. Diks, W. Rytter, Algorytmy i struktury danych, wyd. III, WNT, Warszawa 2001
2. A. Drozdek, C++. Algorytmy i struktury danych, Helion, Gliwice 2004
3. T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, Wprowadzenie do algorytmów, WNT, Warszawa 1997

RECOMMENDED READING:
1. A. Drozdek, D. L. Simon, Struktury danych w języku C, WNT, Warszawa 1996
2. B. Eckel, Thinking in C++, Helion, Gliwice 2002
Field of study: Informatics
Course listing in the Schedule of Courses:
Year/semester:Year II - Semester 4
Number of ECTS credits: 5
Form of assessment: Examination
Field of study: Mathematics
Course listing in the Schedule of Courses:
Year/semester:Year I - Semester 2
Number of ECTS credits: 5
Form of assessment: Examination
Year/semester:Year II - Semester 4
Number of ECTS credits: 5
Form of assessment: Examination
Year/semester:Year II - Semester 4
Number of ECTS credits: 5
Form of assessment: Credit