Advanced Algorithms and Data Structures 420-IS2-2ZASD
Profile of studies: general academic
Form of studies: full-time
Course type: obligatory
Field and discipline of science: exact and natural sciences, computer science
Year of studies/semester: 2 / 3
Preliminary requirements (so-called sequential system of classes and examinations): no
Number of class hours:
- lecture: 30 h
- laboratory classes: 15 h
Didactic methods: lecture, presentation, discussion, laboratory, project.
ECTS credits: 4
Details of student's workload (activity and number of hours):
- Attendance at classes:
- - lecture : 30 h
- - laboratory: 15 h
- Preparation for classes:
- - lecture: 8 h
- - laboratory: 6 h
- Literature studying: 12 h
- Student's own works on computer programs, projects, reports, presentations, homeworks: 16 h
- Preparation for exam: 8 h
- Attendance at exam: 2 h
- Attendance at office hours: 4 h
Quantitative indicators:
- Student's workload related to activities that require direct participation of a teacher: 51 h / 2,0 ECTS
- Student's workload related to activities that do not require direct participation of a teacher: 50 h / 2,0 ECTS
Type of course
Mode
(in Polish) zdalnie
Course coordinators
Learning outcomes
- Has got enhanced knowledge of algorithms, data structures, and methods for implementing them. KA7_WG1
- Knows techniques for solving difficult algorithmic problems. KA7_WG1
- Is able to develop a solution to a nontrivial algorithmic problem and to study the solution with respect to correctness and complexity. KA7_UO4, KA7_UK4, KA7_UW3
- Is able to implement a complicated algorithm as a computer program, optimizing computations and memory usage. KA7_UO4, KA7_UK4, KA7_UW3
- Is able to retrieve, evaluate, and integrate informations related to a problem, so as to develop an optimal algorithmic solution. KA7_UU1
- Understands the necessity for continuously improving his/her skills. KA7_UU2
Assessment criteria
Credit type: examination
Students cannot be examined before passing the laboratory/exercises.
Bibliography
Essential bibliography:
- T.H. Cormen, C.E. Leiserson, R.L. Rivest, "Wprowadzenie do algorytmów", PWN, 2012
- R. Sedgewick, K. Wayne, "Algorytmy", Wyd. 4, Helion, 2012
- L. Banachowski, K. Diks, W. Rytter, "Algorytmy i struktury danych", PWN, 2017
Supplementary readings:
- M.T. Goodrich, R. Tamassia, M.H. Goldwasser, "Structures and Algorithms in Java/Python/C++", Wiley, 2014
- P. Wróblewski, "Algorytmy. Struktury danych i techniki programowania", Wyd. 5, Helion, 2015
- A. Drozdek, "C++. Algorytmy i struktury danych", Helion, 2004
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: