Notes of Algorithms Learning

Записките ми за упражнения по "Дизайн и анализ на алгоритми"

This repository contains all the solutions of assignments, starter files and other materials related to this specialization.

Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University

🧙🏾‍♂️ Complex Algorithms and Complexity Course from the University of San Diego

Strip Packing Written in C++

Presents a reduction from 3DM to Nonogram

Algorithms-Specialization from Stanford:

All the Programs of the 5th Sem Analysis of Algorithms Lab with their output in different steps. This lab provides students with hands-on experience in implementing, analyzing, and comparing fundamental algorithms. It focuses on practical exposure to algorithm design techniques such as divide and conquer, greedy methods, dynamic programming etc.

Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).

Foundations of Computer Science

What I learned from Data Structures and Algorithms Specialization on Coursera.

Strategies for solving a power system network planning problem through greedy strategies, using dynamic programming and flow approximation algorithms. NP-Completeness analysis. The Min K-Cut problem

Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.

This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.

Graph algorithms as a potential benchmark for the minimization of the instruction footprint.

Algorithm Analysis and Development

Non-Deterministic Objects library (CombView API)

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

Repositório da cadeira de Análise e Projeto de Algoritmos

An 8086 assembly quiz game on computational complexity, featuring user authentication, randomized MCQs, case-insensitive input, a 12-second timer, and a leaderboard. Built with BIOS interrupts and modular code, runs on 8086 emulators.

An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C

Detailed exploration of the Maximum Clique Problem, including NP-completeness, algorithmic approaches. Completed as part of the final project for Algorithm Analysis and Design course.