Greedy Algorithm to find the maximum number of mutually compatible jobs

Data Structure problems

Some important algorithms implementation

Implementation for different algorithms analyzing their performance (Big O Notation) and category.

Each sub-project in rBed_bgmc uses machine learning, statistics, etc to solve NP-hard problems, like combinatorial optimization problems.

Greedy algorithm and dynamic programming solutions for scheduling problem

Graph, Greedy, Divide-and-Conquer and NP-Complete algorithms.

Some of the LeetCode exercises I do and will perform

All of my original scripts written for Computer Science 2

An Implementation of Standard Algorithms in Java.

The aim of the course is to provide a solid knowledge on how to design and analyse the most important classes of algorithms.

Programming practice using greedy algorithm

Operating Systems Process Scheduling Implemented Using Java

There is a robot for a library.A sample input file is given below. The first 10 rows represent the adjacency matrix. Then, each room’s name is followed by weight and number of pages of books in 5 rooms. Knapsack algorithm is for maximaxing the total number of pages (it can pick total of 5 kilograms of books from 5 rooms )and Prim algorithm is used.

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.

All data structures and problems implemented in various languages.

Greedy Algorithms and Dynamic Programming

Data Structure and Algorithms in Java

#DSA: LeetCode Challenges

University Project. Main Topics : Recursion, Graphs, BackTracking, Greedy, Djikstra, Kruskal