Designed this project as a Teacher Assistant for the Data Structures course.

Some important "Data Structure": Linked List, Stack, Queue, Tree, Binary Tree, Min Heap, Max Heap and Graph data structure along with important functions are implemented in C/C++.

The project implements a construction project scheduler to keep track of all the buildings under construction using Min Heap and Red Black Trees. These Data Structures help identify the priority and progress of construction.

An efficient C++ representation of an edge-based (un)directed graph {V,E} with search and other graph theory algorithms, plus a basic implementation of Teresco's METAL highway pathfinding project.

Implementation of min Heap data structure in C++ using dynamic arrays.

Compression and Decompression of text using Canonical Huffman Coding in C++.

Insertion Sort, Quick Sort, Merge Sort, Min Heap, Priority Queue, Red Black Tree, Order Statistic Tree, Graph Creation, Breadth-First and Depth-First Search and Homework Assignments

适用于事件驱动系统的定时器（线程安全）Timers for event-driven systems (thread safe)

C++ CRUD with external sort and search algorithms. Final project for GAC108 Data Structures at UFLA 2023-1

This is a job scheduling problem solved with minimum complexity. A new city is being constructed and a program is required to keep track of all the buildings that have been built. A building record has 3 fields: Building number, Executed time and Total time. The Min Heap is used to store the buildings based on Executed Time and the RBT stores it…

A C++ Program that can create an array of processes and performs cpu scheduling.

Mab.CppBasicStructure is a set of data structure class, like heap stack and queue for c++

Magnet tape sorting simulator.

Data Structures Repo. Contain implementation of various basic data structures.

Computer Science 2nd semester - Data Structure

This repository contains my solutions to the LeetCode Daily Challenges of August implemented in C++

✈️ Shortest Path Algorithms: DFS, BFS, Dijkstra, Bellman-Ford, Floyd

Red Black tree and Priority Queue implementation for solving complex problems.

This repository contains code for ADTs that I implemented in my Data Structures and Algorithms course.