{"id":22427993,"url":"https://github.com/grindelfp/notebookstask","last_synced_at":"2025-06-27T03:37:18.569Z","repository":{"id":148472071,"uuid":"620517853","full_name":"GrindelfP/notebooksTask","owner":"GrindelfP","description":"One of the programming tasks on Decision Theory Uni course ","archived":false,"fork":false,"pushed_at":"2023-04-12T06:52:59.000Z","size":41,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-27T06:45:06.832Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Kotlin","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GrindelfP.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-03-28T20:55:46.000Z","updated_at":"2023-03-28T20:56:12.000Z","dependencies_parsed_at":"2023-05-20T08:30:31.044Z","dependency_job_id":null,"html_url":"https://github.com/GrindelfP/notebooksTask","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GrindelfP/notebooksTask","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GrindelfP%2FnotebooksTask","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GrindelfP%2FnotebooksTask/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GrindelfP%2FnotebooksTask/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GrindelfP%2FnotebooksTask/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GrindelfP","download_url":"https://codeload.github.com/GrindelfP/notebooksTask/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GrindelfP%2FnotebooksTask/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262182885,"owners_count":23271705,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-12-05T20:13:29.559Z","updated_at":"2025-06-27T03:37:18.545Z","avatar_url":"https://github.com/GrindelfP.png","language":"Kotlin","funding_links":[],"categories":[],"sub_categories":[],"readme":"# The Notebooks Task\nThe third task on Decision Theory Uni course. It is dedicated\nto using multiple decision-making methods. The program is given set\nof data: 12 alternatives of laptops to buy. The program should make a decision\nwhich laptop to buy based on their criterion as well as the importance of each criteria.\n\n## Methods of decision-making\n1. Generating a Pareto's set, which is simply removing the worst alternatives (those which are worse than others by every criterion);\n2. Narrowing a Pareto's set (this method cam be applied also to the \"raw\" set of every alternative) by comparing it to the worst acceptable criterion;\n3. Sub-optimisation of the narrowed set: getting the best possible alternative by maximising one chosen criteria;\n4. Lexicographical method which sorts criteria by importance and the result is the best alternative by first criteria (if not unique - second criteria etc.);\n5. Method of combined criteria: criterion multiplied by certain coefficients are summed and the alternative, which gave best sum is the result.\n\n## Project structure\nProject is divided in several parts, which are:\n- Data preprocessing: this part interprets data as object DataSet, which contains list of objects of Entry type, which contains information about each alternative;\n- Decision-making: this part applies methods stated before to the data, to make a decision about which laptop is the best alternative. \n\n## How to run\n- add the absolute path to `dataset/laptop_data.json` file to the respective entry in [configurations.conf](src/main/resources/configurations.conf)\n- [run the program](src/main/kotlin/to/deepstorage/notebookstask/RunMe.kt) \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrindelfp%2Fnotebookstask","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgrindelfp%2Fnotebookstask","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgrindelfp%2Fnotebookstask/lists"}