{"id":22865699,"url":"https://github.com/nitinkedia7/cs210-data-structures","last_synced_at":"2025-07-27T15:39:04.944Z","repository":{"id":72767847,"uuid":"101111911","full_name":"nitinkedia7/CS210-Data-Structures","owner":"nitinkedia7","description":"Solutions to assignments of  CS201/210 Data Structures course taught at IITG-2017","archived":false,"fork":false,"pushed_at":"2017-12-05T06:58:01.000Z","size":9387,"stargazers_count":1,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-06T14:32:56.355Z","etag":null,"topics":["data-structures","graph","hashing-algorithm","heap","linked-list","queue","soritng","stack","tree"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nitinkedia7.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":"2017-08-22T22:12:38.000Z","updated_at":"2023-03-24T05:05:13.000Z","dependencies_parsed_at":"2023-03-11T14:00:30.863Z","dependency_job_id":null,"html_url":"https://github.com/nitinkedia7/CS210-Data-Structures","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/nitinkedia7%2FCS210-Data-Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nitinkedia7%2FCS210-Data-Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nitinkedia7%2FCS210-Data-Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nitinkedia7%2FCS210-Data-Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nitinkedia7","download_url":"https://codeload.github.com/nitinkedia7/CS210-Data-Structures/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246450403,"owners_count":20779406,"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":["data-structures","graph","hashing-algorithm","heap","linked-list","queue","soritng","stack","tree"],"created_at":"2024-12-13T11:38:37.138Z","updated_at":"2025-03-31T09:47:48.586Z","avatar_url":"https://github.com/nitinkedia7.png","language":"C++","readme":"# CS210-Data-Structures\nCourse- CS201 **Data Structures Theory**, CS210 **Data Structures Lab** (by Prof. Chandan Karfa)\n\nLanguages Used- **C/C++**\n\n## Selected Problems:\n\n### Arrays and Sorting\n- [Bubblesort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab3/160101048_LA3_1.c)\n- [Insertionsort using Binary Search](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline5/160101048_OA5_1.cpp)\n- [Quicksort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline4/160101048_OA4_1.c)\n- [Finding number of Inversions in a array using Mergesort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline5/160101048_OA5_2.cpp)\n- [Radixsort with Countsort Subroutine](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/practice/radixSort.cpp) \n- [Heapsort](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest2/160101048_LT2_1.c)\n\n### Linked List\n- [Reverse a Linked List](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab1/160101048_LA1_1.c)\n- [Search in a Linked List which may contain a cycle](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline1/160101048_OA1_1.c)\n\n### Stack \u0026 Queue\n- [Evaluate Post-fix Expression](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab1/160101048_LA1_2.c)\n- [Find valid Stack Permutation](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline1/160101048_OA1_2.c)\n\n### Tree\n- [Create a Binary Tree and Print In/Pre/Postorder](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab2/160101048_LA2_1.c)\n- [Create and Print Threaded Binary Tree](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest1/160101048_LT1_1.c)\n- [Huffman Encoding](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline2/160101048_OA2_2.c)\n- [Selection Tree](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline3/160101048_OA3_1.cpp)\n- [Binary Search Tree Implementation](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest4/160101048_LT4_1.cpp)\n- [Find all input sequences which can generate a given Binary Search Tree ](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline11/160101048_OA11_1.cpp)\n\n### Heap\n- [minHeap using array](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline6/160101048_OA6_3.cpp)\n- [Priority Queue using minHeap](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/practice/minHeapPQ.cpp)\n- [Binomial heap with Commandline Interface](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline6/160101048_OA6_4.cpp)\n- [Fibonacci Heap with Commandline Interface](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline7/160101048_OA7_2.cpp)\n\n### Treap\n- [Treap Implementation (tree+heap)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/endSem/160101048_ENDSEM.cpp)\n\n### Graph\n- [Bifuricate a connected graph using BFS](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab5/160101048_LA5_1.cpp)\n- [DFS Traversal using Stack and label all edge types](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/labTest3/160101048_LT3_1.cpp)\n- [Connected Components of undirected graph](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline8/160101048_OA8_1.cpp)\n- [Tower of Cubes (ACM-ICPC 10051)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline9/160101048_OA9_1.cpp)\n- [Playing with Wheels (ACM-ICPC 10067)](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline9/160101048_OA9_2.cpp)\n\n### Hashing\n- [Implement Linear, Quadratic \u0026 Double Hashing](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/lab6/160101048_LA6_1.cpp)\n- [Delete all instances of a pattern in a string using rolling hash](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline10/160101048_OA10_2.cpp)\n- [Compare substrings using hashing by Rabin Karp Algorithm](https://github.com/nitinkedia7/CS210-Data-Structures/blob/master/offline10/160101048_OA10_1.cpp)\n\n\nProblems involving specific scenarios which are to be solved using one's knowledge of data structures are also present.\n\n### Author\n[Nitin Kedia](https://github.com/nitinkedia7/)","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnitinkedia7%2Fcs210-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnitinkedia7%2Fcs210-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnitinkedia7%2Fcs210-data-structures/lists"}