Skip to content

Latest commit

 

History

History
35 lines (24 loc) · 1.34 KB

README.md

File metadata and controls

35 lines (24 loc) · 1.34 KB

Data Structures and Algorithms Course Solutions

This repository contains my solutions to exercises from the Data Structures and Algorithms courses. These courses cover fundamental concepts and implementations of various data structures and algorithms.

Topics

Data Structures Course Topics

  1. Basic concepts and runtime complexity analysis
  2. Recursion and solving recurrence relations
  3. Sorting algorithms (e.g., QuickSort, MergeSort)
  4. Comparison-based sorting and lower bounds
  5. Binary Search Trees (BST)
  6. AVL Trees
  7. Graphs and basic graph algorithms
  8. Breadth-First Search (BFS) and Depth-First Search (DFS)
  9. Minimum Spanning Trees (Kruskal's and Prim's algorithms)
  10. Shortest path algorithms (Dijkstra's and Bellman-Ford)

Algorithms Course Topics

  1. Dynamic Programming
  2. Greedy Algorithms
  3. Flow Networks and Maximum Flow algorithms
  4. approximation algorithms

Disclaimer

These solutions are for educational purposes only. Please adhere to your institution's academic integrity policies. Note that there may be errors in the solutions, and they may not represent the final or most optimal versions. Use these solutions as a reference at your own discretion.

Contributing

While this repository primarily contains my personal solutions, suggestions for improvements are welcome. Please open an issue to discuss potential changes.