![[AvS] Network Algorithmics](https://www.kis.fri.uniza.sk/wp-content/uploads/2020/04/KIS-subject-AvS.png)
Main objectives of the course:
During the course, the student will get acquinted with effective algorithms, data structures and programming techniques used for network nodes software creation. After the course completion, the student will know to apply suitable algorithms and data structures to achieve expected network node behaviour.
Practice lessons:
Aim of the practice lessons is to implement selected problems described during the lectures using chosen programming languages.
Lecturers from the department:
| Course information sheet | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| University: University of Žilina | |||||||||||||
| Faculty: Faculty of Management Science and Informatics | |||||||||||||
| Course ID: 5IN222 | Course name: Network Algorithmics (AvS) | ||||||||||||
| 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 delivered | Present 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: 1. year, summer semester | |||||||||||||
| Study degree: 2. | |||||||||||||
| Required subsidiary courses: Prerequisites: 5II231 Introduction to System Programming (UdSP) Co-requisites: | |||||||||||||
| Course requirements: Continuous assessment / evaluation: Get the admission to the examination students have to actively participate during the exercises throughout the whole semester and they have to elaborate a semester work. Students can earn 30 points during semester. Final assessment /evaluation: In final examination (written and oral) students can earn 70 points. Final grade is determined by the sum of points earned during the course and final exam score. Final evaluation: 100 – 92 A 91 - 84 B 83 - 76 C 75 - 68 D 67 - 61 E To enroll for an exam student must have 30 points. | |||||||||||||
| Course outcomes: During the course, the student will get acquinted with effective algorithms, data structures and programming techniques used for network nodes software creation. After the course completion, the student will know to apply suitable algorithms and data structures to achieve expected network node behaviour. | |||||||||||||
| Course scheme: Lectures: - Description languages and grammars (ASN.1, ABNF). - Network application efficiency in userspace: efficient data handling within application, communication with operating system core, context switching between application and core and reduction of context switching impact on application. - Operating system core subsystems efficiency: timers, message sorting, PDU operations (buffer management, checksums, defragmentation). - Algorithms and data structures used in network nodes: exact search, prefix search, packet classification, packet scheduling. - Hardware point of view of the selected data structures and algorithms. Practice lessons: Aim of the practice lessons is to implement selected problems described during the lectures using chosen programming languages. | |||||||||||||
| Literature: - George Varghese: Network Algorithmics, Elsevier, ISBN-13: 978-0-12-088477-3 - Ivan Sklyarov: Programming Linux hacker tools uncovered : exploits, backdoors, scanners, sniffers, brute-forcers, rootkits, A-List, ISBN: 1931769613 - Michael Kerrisk: The Linux programming interface : a Linux and UNIX system programming handbook, No Starch Press, ISBN-13: 978-1-59-327220-3 | |||||||||||||
| Instruction language: slovak | |||||||||||||
| Notes: | |||||||||||||
| Course evaluation:: Total number of evaluated students: 10
| |||||||||||||
| A | B | C | D | E | FX | ||||||||
| 60.00 % | 20.00 % | 20.00 % | 0.00 % | 0.00 % | 0.00 % | ||||||||
| Course teachers: Lecture: Ing. Martin Kontšek, PhD. Laboratory: Ing. Martin Kontšek, PhD. | |||||||||||||
| Last updated: 2021-01-19 12:36:00.000 | |||||||||||||
| The person responsible for the course: prof. Ing. Pavel Segeč, PhD. | |||||||||||||
| Approved by: | |||||||||||||