|University: Technical University of Košice|
|Faculty: Faculty of Electrical Engineering and Informatics|
|Department: Department of Computers and Informatics
|Course Number: 26001024||Course Name: Data structures and algorithms in secure software|
|Type, scope and method of learning activities:
Course Type: Lecture, Laboratory exercise
Recommended scope of the course content (in hours):
Full-time study (hours per week): 2,2
Part-time study (hours per semester): 26,26
|Number of credits: 6|
|Recommended semester of study: WT|
|Recommended semester||Study programme||Study grade||Study Method|
|2.rok WT||Cybersecurity (KB_Bc_D_sk)||Bachelor||Attendance|
|Level of study:|
|Course completion requirements:
Assessment and completion of the course: Credit test and examination
Continuous assessment: Student passes the continuous assessment and receives credits when he or she meets the requirement to obtain at least 16% out of 30%.
test, programming project
Final assessment: Student passes the final assessment and passes the examination when he or she meets the requirement to obtain at least 36% out of 70%.
written and oral examination
Overall assessment: Overall assessment is the sum of the assessments obtained by students in the assessment period. The overall result is determined in accordance with the internal regulations of the Technical University in Košice. (Study Regulations, the internal regulation principles of doctoral studies)
Student will acquire the basic knowledge on data structures, their properties and relations to algorithms. He become familiar with methods for design of effective algorithms. Student will learn facts from the area of sorting and order statistics and a way, how to use the knowledge practically.
|Brief course content:
1. Algorithm. Algorithm representation and analysis.
2. Basic data structures.
3. Trees, their representation and traversing.
4. Hashing, hash functions.
5. Binary search trees. Balanced trees.
6. Graphs, graph representations and algorithms.
7. Methods for design of effective algorithms.
8. Sorting in linear time.
9. Comparison sorting.
10. Order statistics.
11. Data structures for external storage.
12. Sorting on external storage.
|Recommended Reference Sources:
1. Cormen, T.H., Leiserson, C.E, Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, 2001.
2. Aho, A.V., Hopcroft, J.E, Ullman, J.D: Data Structures and Algorithms. Addison Wesley, 1983.
3. Aho, A.V.,Hopcroft, J.E., Ullmann, J.D.: The Design and Analysis of Computer Algorithms. Addison Wesley, 1974.
4. Meyer, B.: Object - Oriented Software Construction. Prentice Hall Int. 1988.
5. Linger, R.C., Mills, H.O., Witt, B.I.: Structured Programming: Theory and Practice. Addison Wesley 1979.
6. Heileman, G.L.: Data Structures, Algorithms and Object-oriented Programming. McGraw-Hill, 1996.
7. Knuth, D.E.: The Art of Computer Programming. vol.1-3. Addison Wesley, 1969.
8. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specifications. EATCS Monographs 1990.
|Recommended optional program components:
|Languages required for the course completion:|
Total number of students assessed: 90
doc. Ing. Slavomír Šimoňák, PhD.
|Last modified: 01.09.2022|
|Approved by: person(s) responsible for the study program|