This project can help you understand the Data Structure and Algorithms in a more efficient manner. It aims at scheduling the studies for maximizing marks during exams. Most students face this problem during exams that what to study to get the best out of their limited time.

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.

The project implements a dynamic programming approach to solve the Weighted Interval Scheduling problem, efficiently finding the optimal set of non-overlapping jobs with maximum profit from a given set of intervals.

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…

The problem of Weighted Job Scheduling considers a set of jobs. Each job has a start time, a finish time and a profit. The goal is to find a subset of jobs with the maximum profit such that no two jobs in the subset overlap. My solution uses Dynamic Programming.

Job scheduling : Greedy Algorithm versus Brute Force Algorithm. Comparison of time of complexities.