Algorithmics and Advanced Data Structures Field of study: Computer Science
Programme code: W4-N2IN19.2021

Module name: Algorithmics and Advanced Data Structures
Module code: W4-IN-N2-20-1-AiZSD
Programme code: W4-N2IN19.2021
Semester:
  • winter semester 2022/2023
  • summer semester 2021/2022
Language of instruction: Polish
Form of verification: exam
ECTS credits: 4
Description:
Algorithmics is the science of algorithms. It includes algorithm design, i.e. the art of building a schema that effectively solves a specific problem or class of problems as well as algorithm analysis. The purpose of this module is to introduce the listener to advanced methods of algorithm design and issues of analysis of algorithms as well as data structures.
Prerequisites:
(no information given)
Key reading:
1. T.H. Cormen, C.E. Leiserson, R.L.Rivest: Introduction to algorithms. 2. R.L.Graham, D.E.Knuth, O.Patashnik: Concrete mathematics.
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]
Has knowledge in the field of advanced methods of determining the computational complexity of algorithms. Knows and understands classes of algorithms complexity. [M_001]
 K_W01 [2/5] K_W04 [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. [M_002]
 K_W04 [4/5]
Has knowledge in the field of graph algorithms. [M_003]
 K_W01 [1/5] K_W04 [3/5]
Knows the concept of approximation algorithm and examples of such algorithms using different approaches, e.g. combinatorial or based on the theory of linear programming. [M_004]
 K_W01 [1/5] K_W04 [3/5]
Knows examples of Monte-Carlo and Las-Vegas randomized algorithms. [M_005]
 K_W01 [1/5] K_W04 [3/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. [M_006]
 K_W01 [2/5] K_W04 [2/5]
Can choose and implement an appropriate, basic or advanced paradigm of algorithm construction for solution of a given problem. Can justify his choice. [M_007]
 K_U08 [1/5] K_U09 [3/5]
Is able to implement an appropriate algorithm to solve a given problem, as well as select the appropriate data structure. [M_008]
 K_U09 [3/5]
Is aware of substantial importance of algorithm features (complexity, correctness) on the basis of which the components (modules, functions, procedures) of bigger software systems are built on final efficiency, correctness of operation and security of these systems. [M_009]
 K_U09 [2/5] K_K01 [1/5]
Type Description Codes of the learning outcomes of the module to which assessment is related
Written exam [W_001]
Verification of knowledge basing on content presented during lectures.
 M_001 M_002 M_003 M_004 M_005 M_006 M_009
Reports [W_002]
Solving assigned tasks and elaborating them in the form of reports.
 M_006 M_007 M_008 M_009
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 [Z_001]
Presenting educational content 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.
 20
Exam preparation.
 40 Written exam [W_001]
laboratory classes [Z_002]
Detailed preparation of the students for solving tasks indicating proceeding methodology and proceedings sequence.
 20
Individual solution of tasks given during the laboratory class, elaboration of reports.
 40 Reports [W_002]
Attachments
Module description (PDF)
Information concerning module syllabuses might be changed during studies.
Syllabuses (USOSweb)
Semester Module Language of instruction
(no information given)