[AaUD1] Algorithms and Data structures 1

BCKIS

[AaUD1] Algorithms and Data structures 1

Main objectives of the course:

Student obtains basic knowledges from the theory of data strusctures and learns their efficient implementation.
After course graduation student:
– knows basic data structures and knows use them during practical problems solving,
– knows process of efficient implemetation of basic data strustures.

The course information sheet
Course information sheet
University: University of Žilina
Faculty: Faculty of Management Science and Informatics
Course ID: 5UI124Course name: Algorithms and Data structures 1 (AaUD1)
Form, extent and method of teaching activities:
Number of classes per week in the form of lectures,
laboratory exercises, seminars or clinical practice		Lectures: 2.0 Seminars: 0.0 Lab.exercises: 2.0
Methods by which the educational activity is deliveredPresent form of education
Applied educational activities and methods suitable for achieving learning outcomes
Number of credits: 5.0
Study workload: hours
Specification of the study workload:
Recommended term of study: 2. year, summer semester
Study degree: 1.
Required subsidiary courses:
Prerequisites:
Informatics 1, Informatics 2
Co-requisites:
Course requirements:
Continuous assessment / evaluation:
Continuous work classification is based on number of points, retrieved on tests end presentation of course works. Maximal number of obtained points is 50.
Student can sign on final examination only if he has obtained minimal 30 points.

Final assessment /evaluation:
Necessary requirement to complete the subject is to complete final examination. Final examination consists on written examinantion (max. 25 points) and oral examination (max. 25 points). Minimal number of points, necessary for complete examinanation is 13 for every part od examination.
Final classification is based on sum of obtained points:
93 - 100 points- A
85 - 92 points - B
77 - 84 points - C
69 - 76 points - D
61 - 68 points - E
less then 61 points – FX

To enroll for an exam student must have 61 points.
Course outcomes:
Student obtains basic knowledges from the theory of data strusctures and learns their efficient implementation.
After course graduation student:
- knows basic data structures and knows use them during practical problems solving,
- knows process of efficient implemetation of basic data strustures.
Course scheme:
Lectures:
Memory management.
Memory complexity and computational complexity of algorithms.
Recursion.
Abstract data types and their implementation - set, array, list, queue, stack, priority queue, tree structures, table.
Sorting and searching algorithms, their complexity and implementation.

Exercises:
Contents of exercises corresponds on lectures. Exercises are focussed on utilization of particular data structures and on their efficient implementation (minimal memory and computational complexity, observance of principles of object-oriented programming).
Literature:
Wirth: Algoritmy a štruktúry údajov, Alfa 1988
Lewis,H.,R., Denenberg,L.: Data Structures and their Algorithms. Addison-Wesley, 1991
Goodrich,M.,T., Tambassia,R.: Algorithm Design. John Willey & Sons, 2002
Instruction language: slovak
Notes:
Course evaluation::
Total number of evaluated students: 132
ABCDEFX
9.85 %15.91 %18.18 %15.15 % 1.52 %39.39 %
ABCDEFX
9.85 %15.91 %18.18 %15.15 % 1.52 %39.39 %
Course teachers:
Lecture: Ing. Michal Varga, PhD.
Laboratory: doc. Ing. Miroslav Kvaššay, PhD.
Laboratory: doc. Ing. Marek Kvet, PhD.
Laboratory: Ing. Michal Mrena, PhD.
Laboratory: Ing. Michal Varga, PhD.
Last updated: 2021-08-26 11:09:19.000
The person responsible for the course: doc. Ing. Norbert Adamko, PhD.
Approved by:
SOURCE: https://vzdelavanie.uniza.sk/vzdelavanie/planinfo.php?kod=274635&lng=en