{"id":25185893,"url":"https://github.com/mazensayed91/algorithms-i-coursera-princeton","last_synced_at":"2025-10-03T15:18:45.465Z","repository":{"id":111421764,"uuid":"289012340","full_name":"Mazensayed91/Algorithms-I-Coursera-Princeton","owner":"Mazensayed91","description":null,"archived":false,"fork":false,"pushed_at":"2020-08-24T18:27:03.000Z","size":1069,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-09T19:43:16.117Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/Mazensayed91.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":"2020-08-20T13:22:52.000Z","updated_at":"2020-08-24T18:27:05.000Z","dependencies_parsed_at":"2023-03-13T13:40:15.046Z","dependency_job_id":null,"html_url":"https://github.com/Mazensayed91/Algorithms-I-Coursera-Princeton","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mazensayed91%2FAlgorithms-I-Coursera-Princeton","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mazensayed91%2FAlgorithms-I-Coursera-Princeton/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mazensayed91%2FAlgorithms-I-Coursera-Princeton/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mazensayed91%2FAlgorithms-I-Coursera-Princeton/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Mazensayed91","download_url":"https://codeload.github.com/Mazensayed91/Algorithms-I-Coursera-Princeton/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247149460,"owners_count":20891949,"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":"2025-02-09T19:40:50.101Z","updated_at":"2025-10-03T15:18:45.410Z","avatar_url":"https://github.com/Mazensayed91.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms-I-Coursera-Princeton\nThis repo represents the programming assignments form Cousera online course, Introduction to Algorithms, created by Princeton University, taught by: Kevin Wayne, Senior Lecturer and Robert Sedgewick, Professor.\n\n# Here are description for the assignments in order (still working on them).\n## 1-Percolation:\nGiven a composite systems comprised of randomly distributed insulating and metallic materials: what fraction of the materials need to be metallic so that the composite system is an electrical conductor? Given a porous landscape with water on the surface (or oil below), under what conditions will the water be able to drain through to the bottom (or the oil to gush through to the surface)? Scientists have defined an abstract process known as percolation to model such situations.\n\nThe problem : what is the probability that the system percolates?\nIt has no closed formula to get this probability so Monte Carlo simulation should be used.\n\n## 2-Deques and Randomized Queues:\nIn this assignment i created 2 datastructures and used one of them to solve a certain problem.\nFirst datastructure : Dequeue. A double-ended queue or deque (pronounced “deck”) is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure.\nSeconed datastructure : Randomized queue. A randomized queue is similar to a stack or queue, except that the item removed is chosen uniformly at random among items in the data structure.\nThe problem : Write a client program Permutation.java that takes an integer k as a command-line argument; reads a sequence of strings from standard input using StdIn.readString(); and prints exactly k of them, uniformly at random. Print each item from the sequence at most once.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmazensayed91%2Falgorithms-i-coursera-princeton","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmazensayed91%2Falgorithms-i-coursera-princeton","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmazensayed91%2Falgorithms-i-coursera-princeton/lists"}