University of Bialystok - Central Authentication SystemYou are not logged in | log in
course directory - help

Algorithms and Data Structures

General data

Course ID: 0600-IS1-2ASD#a Erasmus code / ISCED: 11.101 / (0541) Mathematics
Course title: Algorithms and Data Structures Name in Polish: Algorithms and Data Structures
Department: (in Polish) Instytut Informatyki
Course groups: (in Polish) 2 rok 1 stopnia sem. zimowy Informatyka
(in Polish) 3L stac. I st. studia informatyki - przedmioty obowiązkowe
ECTS credit allocation (and other scores): 5.00
view allocation of credits
Language: English
Type of course:

obligatory courses


Elements of Logic and Set Theory 0600-IS1-1PLTM
Introduction to Structured Programming 0600-IS1-1PPS#a
Mathematical Analysis 1 0600-IS1-1AM1


Introduction to Object-Oriented Programming 0600-IS1-1WPO#a

Short description:

The aim of the course is to familiarize students with the basic data structures (lists, stacks, queues, hash tables, trees, graphs), algorithms (graph algorithms, pattern matching in strings) and differnt methods of their design (“devide and concuer”, dynamic programming, greedy methods) and also estimation of their complexity.

Full description:

Course profile: General Academic

Form of study: Full-time studies

Course type: Obligatory

Year/semester of study: 2 / 3

Prerequisites (sequential system of courses and exams): Items introducing: Mathematical analysis 1, Elements of Logic and Set Theory, Introduction to Structural Programming, Introduction to Object-Oriented Programming,

Lecture: 30 Exercise classes: 30

Teaching methods: Lecture, exercises

ECTS credits: 5

Balance of student workload:

Class attendance:

- lecture 30h

- exercise classes: 30h

Course preparation:

- lecture 15h

- exercise classes: 15h

Literature study: 5h

Reports, homeworks: 10h

Preparation for tests: 8h

Preparation for the exam: 15h

Exam duration: 2h

Individual consultation with the teacher: 3h

Student workload:

Direct interaction with the teacher: 65, 2 ECTS

Practical exercises: 45, 2 ECTS



T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, „Introduction to Algorithms”, MIT, 1994

Learning outcomes:

Learning outcomes:

The student knows the basic notions and methods of algorithm design and analysis. K_W03

The student knows the basic data structures and selected algoritms using them. K_W03

The student can estimate the complexity of simple algorithm K_U06

The student can applay and analise the selected algorithms that base on the method “devide and concuer” in the field of sorting and searching. K_U06, K_U08

The student can perform basic dictionary operations on the selected data structures. K_U06

The student can applay the selected pattern matching algorithm. K_U06, K_U08

The student understands the necessity of permanent studying. K_K02

Assessment methods and assessment criteria:

Form of assessment: written test

Classes in period "Academic year 2018/2019" (in progress)

Time span: 2018-10-01 - 2019-06-30
Choosen plan division:

see course schedule
Type of class: Class, 30 hours more information
Lecture, 30 hours more information
Coordinators: (unknown)
Group instructors: (unknown)
Students list: (inaccessible to you)
Examination: Examination
Course descriptions are protected by copyright.
Copyright by University of Bialystok.