Abstract data structures (ćwiczenia) - 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
INTRODUCTORY COURSES AND PREREGUISITES:
Introduction to programming, basics of algorithms and programming, object-oriented programming.
Basic programming skills required.
OBJECTIVES OF THE COURSE:
Presentation of the basic data structures. Showing the application of known structures. Basic operations on data structures.
EXPECTED LEARNING OUTCOMES:
To familiarize students with data structures. Implementation of structures. Overview of the properties of data structures. Operations on structures. The use of data structures. Ability to programming using the known data structures. The inclusion of data structures to already possessed knowledge of programming.
KNOWLEDGE:
The student has theoretical and practical knowledge on known data structures. The student has knowledge of programming that allows to use knowledge they have acquired in the process of creating computer programs.
SKILS:
Student is able to distinguish between the discussed structures. He has the ability to use data structures in the process of creating computer programs. Students can design a template class for each structure. The student is able to solve problems requiring the use of known data structures.
Learning outcomes
Teaching method
Course content description
[Dr J. Kapusta, Mgr M. Cis, Mgr A. Gajda - 2011/12]
COURSE CONTENTS:
Files. Binary files and templates. Stack. Reverse Polish notation. Queue. Unidirectional and bidirectional lists. Priority Queue. Trees.
Forms of assessment
Required reading list
REQUIRED READING:
L. Banachowski, K. Diks, W. Rytter, Algorytmy i struktury danych, wyd. III, WNT, Warszawa 2001.
A. Drozdek, C++. Algorytmy i struktury danych, Helion, Gliwice 2004.
T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, Wprowadzenie do algorytmów, WNT, Warszawa 1997.
RECOMMENDED READING:
A. Drozdek, D. L. Simon, Struktury danych w języku C, WNT, Warszawa 1996.
B. Eckel, Thinking in C++, Helion, Gliwice 2002.
OTHER LEARNING RESOURCES
Blackboard, a multimedia projector (for presenting students with the effects of the implementation of data structures).
Field of study: Informatics
Course listing in the Schedule of Courses:
Year/semester:Year II - Semester 4
Number of ECTS credits: 0
Form of assessment: Grade
Field of study: Mathematics
Course listing in the Schedule of Courses:
Year/semester:Year I - Semester 2
Number of ECTS credits: 0
Form of assessment: Grade
Year/semester:Year II - Semester 4
Number of ECTS credits: 0
Form of assessment: Grade