13S112ASP2 - Algorithms and Data Structures 2
| Course specification | ||||
|---|---|---|---|---|
| Course title | Algorithms and Data Structures 2 | |||
| Acronym | 13S112ASP2 | |||
| Study programme | Software Engineering | |||
| Module | ||||
| Type of study | bachelor academic studies | |||
| Lecturer (for classes) | ||||
| Lecturer/Associate (for practice) | ||||
| Lecturer/Associate (for OTC) | ||||
| ESPB | 6.0 | Status | elective | |
| Condition | ||||
| The goal | Teaching students the algorithms and corresponding data structures used for searching and sorting. | |||
| The outcome | In addition, the student should also be able for program implementation of searching and sorting algrithms and for solving of the pratical problems. | |||
| Contents | ||||
| URL to the subject page | https://rti.etf.bg.ac.rs/rti/ri3sp/index_si2.html | |||
| Contents of lectures | Searching. Basic searching methods and their improvements. Binary search tree, AVL trees, red-black trees, optimal search tree. M - ary search tree. B, B*, and B + trees. Digital search trees. Hashing – hash functions and collision resolving. External hashing. Sorting. Insertion, selection, exchange and merge methods. Sorting of linear complexity. Heaps. | |||
| Contents of exercises | lab exercises, homeworks | |||
| Literature | ||||
| ||||
| Number of hours per week during the semester/trimester/year | ||||
| Lectures | Exercises | OTC | Study and Research | Other classes |
| 2 | 2 | 1 | ||
| Methods of teaching | auditory class lessons and exercises with presentations, lab exercises, homeworks | |||
| Knowledge score (maximum points 100) | ||||
| Pre obligations | Points | Final exam | Points | |
| Activites during lectures | 0 | Test paper | 70 | |
| Practical lessons | 30 | Oral examination | 0 | |
| Projects | ||||
| Colloquia | 0 | |||
| Seminars | 0 | |||