Advanced algorithm and data structures Field of study: Computer Science
Programme code: 08-S2INIA15.2019

Module name: Advanced algorithm and data structures
Module code: 08-IN-S2-ZAiSD
Programme code: 08-S2INIA15.2019
Semester: summer semester 2019/2020
Language of instruction: English
Form of verification: exam
ECTS credits: 5
Description:
Aim is to introduce the student into advanced issues of algorithms, data structures and techniques of designing algorithms.
Prerequisites:
(no information given)
Key reading:
(no information given)
Learning outcome of the module Codes of the learning outcomes of the programme to which the learning outcome of the module is related [level of competence: scale 1-5]
Is aware of substantial importance of algorithm features (complexity, correctness) on which there are components constructed (modules, functions, procedures) of bigger software systems for final efficiency, operation correctness and security of these systems. [ZAiSD -K_10]
 K_K01 [1/5]
Can designate computational complexity of recurrent algorithms and record their complexity , e.g. in the form of recurrent equation and solve such an equation. [ZAiSD -U_6]
 K_U01 [1/5] K_U07 [1/5] K_U08 [1/5]
Can choose and implement an appropriate, basic or advanced paradigm of algorithm construction for solution of a given problem. Can justify his choice. [ZAiSD -U_7]
 K_U12 [4/5] K_U15 [1/5]
Can choose and implement an appropriate text algorithm for a given problem taking into account requirements as to search time and memory consumption. [ZAiSD -U_8]
 K_U12 [4/5] K_U15 [1/5]
Can choose and implement an appropriate algorithm for a given graph problem and design sufficient data structure representing problem modeling graph. [ZAiSD -U_9]
 K_U12 [4/5] K_U15 [1/5]
Has knowledge in the field of advanced methods of determining the computational complexity of algorithms. Knows and understands classes of algorithms complexity. [ZAiSD -W_1]
 K_W02 [1/5] K_W03 [2/5]
Has knowledge in the field of advanced paradigms of algorithms constructing, among others: exhaustive search, greedy strategies. Knows and understands basics of operation and advantages and disadvantages of these algorithms. [ZAiSD -W_2]
 K_W09 [4/5]
Has knowledge in the field of graph algorithms. [ZAiSD -W_3]
 K_W02 [1/5] K_W09 [4/5]
Has knowledge in the field of text algorithms. [ZAiSD -W_4]
 K_W09 [4/5]
Has knowledge in the field of approximation algorithms. [ZAiSD -W_5]
 K_W09 [4/5]
Type Description Codes of the learning outcomes of the module to which assessment is related
Written exam [ZAiSD _w_1]
Verification of knowledge basing on content presented during lectures. Exam is composed of open theoretical questions and at least two tasks of content.
 ZAiSD -K_10 ZAiSD -U_6 ZAiSD -W_1 ZAiSD -W_2 ZAiSD -W_3 ZAiSD -W_4 ZAiSD -W_5
Reports credit [ZAiSD _w_2]
Elaborating reports in writing and their verbal crediting in a fixed time as a verification of skills acquired while problem solving.
 ZAiSD -K_10 ZAiSD -U_6 ZAiSD -U_7 ZAiSD -U_8 ZAiSD -U_9
Form of teaching Student's own work Assessment of the learning outcomes
Type Description (including teaching methods) Number of hours Description Number of hours
lecture [ZAiSD _fs_1]
Presenting educational content in verbal form with use of audio-visual aids and other written education aids. Focusing on issues difficult to understand and these with deeper theoretical bases. Elicitation of students by asking questions concerning presented content.
 30
Exam preparation.
 30 Written exam [ZAiSD _w_1]
laboratory classes [ZAiSD _fs_2]
Detailed preparation of the students for solving tasks indicating proceeding methodology and proceedings sequence.
 30
Laboratory class preparation. Individual solution of tasks given during the laboratory class, elaboration of reports.
60 Reports credit [ZAiSD _w_2]
Attachments
Module description (PDF)
Information concerning module syllabuses might be changed during studies.
Syllabuses (USOSweb)
Semester Module Language of instruction
(no information given)