Skip to content

A repository for uploading exercises from the FMI SDA (Data Structures and Algorithms) Course 2023-2024.

Notifications You must be signed in to change notification settings

asen-krasimirov/SDA-Course-FMI-2024

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SDA-Course-FMI-2024

A repository for uploading exercises from the FMI SDA (Data Structures and Algorithms) Course 2023-2024.

Control Exam contest links ( and solutions* ):

- Exam 01 (Sorting Algorithms) (solutions) 
- Exam 02 (Linked List && Binary Search) (solutions)
- Exam 03 (Queue and Stack && Binary Search Tree) (solutions)
- Exam 04 (AVL and Red-Black Trees && Heap) (solutions)
- Exam 05 (Hash Tables && Graphs) (solutions)
- Exam 06 (Shortest Path in Graph && Minimum Spanning Three in Graph) (solutions)

Note

You can also see exercises for preparation here.

Exam

Contest link | (solutions)

Note

Click here to see past years exams solved.

More Content:

Lab Exercises** | Homework contest links ( and solutions* ):
 1. Introduction:                    Lab | Homework 01 (solutions) 
2. Sorting Algorithms: Lab | Homework 02 (solutions)
3. Searching Algorithms: Lab | Homework 03 (solutions)
4. Linked List: Lab | Homework 04 (solutions)
5. Stack and Queue: Lab | Homework 05 (solutions)
6. Binary Search Tree: Lab | Homework 06 (solutions)
7. AVL and Red-Black Trees: Lab | Homework 07 (solutions)
8. Heap: Lab | Homework 08 (solutions)
9. Hash Tables: Lab | Homework 09 (solutions)
10. Graphs: Lab | Homework 10 (solutions)
11. Shortest Path in Graph: Lab | Homework 11 (solutions)
12. Minimum Spanning Tree in Graph: Lab | Homework 12 (solutions)
13. Exam Preparation I: Lab | Homework 13 (solutions)
14. Exam Preparation II: Lab

Important

* Solutions are not always optimal in terms of memory and speed efficiency, even clean code (they pass all tests 100/100, but there are better solutions)
** Lab Exercises from ViktorGV's seminars and solutions from Asen.
In case of discrepancy, write to the contributors.