Skip to content

All tasks and homeworks from different kind of courses during my education at @fmi - Sofia University.

License

Notifications You must be signed in to change notification settings

petarivanovv9/Sofia-University-Courses-FMI

Repository files navigation

All tasks and homeworks from different kind of courses during my education at @FMI.

Artificial Intelligence course

Databases course

Statistics and Probabilities course

Homework 1

Homework2

Data Structures and Algorithms with C++ course

Data structures implemented in C++

  1. [Stack with Linked Nodes] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Stack-with-LinkedNodes)
  2. [Queue with Linked Nodes] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Queue-with-LinkedNodes)
  3. [Dynamic Array with Proxy] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Dynamic-Array-with-Proxy)
  4. [Linked List] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/LinkedList)
  5. [Binary Search Tree - BST] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/(BST)Binary-Search-Tree)
  6. [Min Binary Heap] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Min-Binary-Heap)
  7. [Trie (prefix tree)] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Trie%20(prefix%20tree))
  8. [Tree] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Tree)

Homeworks from the course

  1. [Homework 1] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-1) - using Stack and some kind of a decompression(2B -> BB and etc).
  2. [Homework 2] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-2) - using Queue, LinkedList, BFS and DFS. Find all available paths from one point to all others in matrix.
  3. [Homework 3] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-3) - using Trie, Vector and merge sort alphabetically.
  4. [Homework 4] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-4)
  5. [Homework 5] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-5)

Other tasks

  1. [RPN] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/RPN) - Reverse Polish notation
  2. [Braces] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Braces)

Object Oriented Programming with C++ course

Homeworks from the course

  1. [Homework 1] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Cars%2C%20files%2C%20Homework%201)
  2. [Homework 2] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Jar%20with%20Cookies%2C%20Homework%202)
  3. [Homework 3] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Vectors%2C%20Homework%203)
  4. [Homework 4] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Homework%204)
  5. [Homework 5] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Homework%205)

Introduction to Programming with C++ course

Homeworks from the course

  1. Homework 1
  2. Homework 2
  3. Homework 3
  4. Homework 4
  5. Homework 5

Releases

No releases published

Packages

No packages published