{"id":34858672,"url":"https://github.com/pvn-a/finetech2k20","last_synced_at":"2026-05-25T10:02:04.925Z","repository":{"id":68546756,"uuid":"256224155","full_name":"pvn-a/FineTech2k20","owner":"pvn-a","description":"Programming assignments for the course Fine Techniques using C, SEM-4","archived":false,"fork":false,"pushed_at":"2020-04-17T04:36:20.000Z","size":28,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-07-16T02:18:40.873Z","etag":null,"topics":["bst","c","dynamic-memory-allocation","linked-list","mymalloc","search-space-tree","second-max","water-jug-problem"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pvn-a.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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-04-16T13:33:41.000Z","updated_at":"2024-07-16T02:18:48.807Z","dependencies_parsed_at":"2023-03-11T03:52:46.645Z","dependency_job_id":null,"html_url":"https://github.com/pvn-a/FineTech2k20","commit_stats":null,"previous_names":["pvn-a/finetech2k20"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/pvn-a/FineTech2k20","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pvn-a%2FFineTech2k20","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pvn-a%2FFineTech2k20/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pvn-a%2FFineTech2k20/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pvn-a%2FFineTech2k20/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pvn-a","download_url":"https://codeload.github.com/pvn-a/FineTech2k20/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pvn-a%2FFineTech2k20/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33469418,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-25T06:32:55.349Z","status":"ssl_error","status_checked_at":"2026-05-25T06:32:35.322Z","response_time":57,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["bst","c","dynamic-memory-allocation","linked-list","mymalloc","search-space-tree","second-max","water-jug-problem"],"created_at":"2025-12-25T20:38:48.691Z","updated_at":"2026-05-25T10:02:04.918Z","avatar_url":"https://github.com/pvn-a.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FineTech2k20\n\nProgramming assignments for the course Fine Techniques using C language.\n\n## Developmental Env\n\nCode developed, debugged and tested on UBUNTU 18.04\n\n### Execution\n\n```\nmake  \n./a.out\n```\n\n### 3_Jug_Problem\n```\nFind out all the solutions to A-B-C jug problem.  \nYou are given 3 jugs of capacities A litres, B litres, and C litres.  \nThe initial state/initial volumes of water in the jugs is X, Y, and Z.  \nYour goal is to get to a final state of P, Q, R litres.  \nThere are no markings on the jugs (you can’t just measure off litres directly).  \nYou may pour from a jug to any other jug (you have to transfer from one jug to another until either one jug becomes empty or the other full) . You cannot waste water. The total amount of water in the entire system must be the same as initial.\n```\n### BST_HardDisk\n```\nImplement a binary search tree on a harddisk.  \nYour tree should support the following operations (mentioned in the header file)\ninsert  \ndelete based on the key  \ntraversal - inorder : space separated values followed by \\n  \ntraversal - pre-order : space separated values followed by \\n  \n```\n### My_Malloc\n```\nFix the flaw in malloc, by implementing your own malloc with best-fit allocation policy.\n```\n### Second_Max\n```\nImplement Stepanov's Binary counter to find the second biggest in an array of integers.  \nThe number of elements may be an exact power of 2 or may not be.  \nThe algorithm should have at most n + logn - 2 comparisons.(However when n is odd the number of comparisons can be little more)  \nIt may use extra space proportional to (logn) ^ 2.\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpvn-a%2Ffinetech2k20","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpvn-a%2Ffinetech2k20","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpvn-a%2Ffinetech2k20/lists"}