Algorithms and Data Structures Course, part 2

This repository contains the assignments and their solutions for the Algorithms and Data Structures course.

Structure

• src/: Source code for various algorithms and data structures covered in the course:
  • AVLPriorityQueue.py: Implementation of a priority queue based on an AVL tree
  • ArrayZigzagTraversalLab.py: Traversing given arrays in a zigzag pattern
  • BFSShortMinesPath.py: Breadth-First Search (BFS) for finding the shortest path, including maze and grid problems
  • BinaryHamstersSearchLab.py: Hell on Earth
  • FiniteAutomataSearch.py: Implementation of finite automata for pattern matching in given strings
  • GameServerLatency.py: Finding minimum latency for a game server using Bellman–Ford algorithm
  • IJonesLabyrinth.py: Maze traversal using Dynamic Programming approach
  • InOrderTraversalSearchLab.py: In-order traversal for binary trees
  • VeniceIslandsInternet.py: Optimisation of network connectivity using Kruskal's algorithm with Disjoint set
• tasks/: Assignments' descriptions
• tests/: Unit tests for the implemented algorithms and data structures

How to Use

1. Clone the repository:

   git clone https://github.com/chrkspln/algo_and_data_structures_course.git
   cd algo_and_data_structures_course

2. Navigate to the desired directory (e.g., src for source code):

   cd src

3. Run the scripts or open them in your preferred IDE to explore the solutions.

Contact

do not <3