{"id":20202469,"url":"https://github.com/krashish8/cso102-lab","last_synced_at":"2026-05-30T20:31:27.372Z","repository":{"id":73553949,"uuid":"212739300","full_name":"krashish8/CSO102-Lab","owner":"krashish8","description":"Lab and Assignment files of the course \"Data Structures and Algorithms\" (CSO102) - Even Semester 2018-19 (2nd Semester)","archived":false,"fork":false,"pushed_at":"2020-03-07T16:48:10.000Z","size":1462,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-03T09:14:40.338Z","etag":null,"topics":["c","data-structures"],"latest_commit_sha":null,"homepage":"","language":"C","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/krashish8.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":"2019-10-04T05:02:04.000Z","updated_at":"2024-12-04T04:01:09.000Z","dependencies_parsed_at":"2023-02-28T08:31:20.993Z","dependency_job_id":null,"html_url":"https://github.com/krashish8/CSO102-Lab","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/krashish8/CSO102-Lab","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krashish8%2FCSO102-Lab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krashish8%2FCSO102-Lab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krashish8%2FCSO102-Lab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krashish8%2FCSO102-Lab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/krashish8","download_url":"https://codeload.github.com/krashish8/CSO102-Lab/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/krashish8%2FCSO102-Lab/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33709269,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-30T02:00:06.278Z","response_time":92,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["c","data-structures"],"created_at":"2024-11-14T04:55:27.487Z","updated_at":"2026-05-30T20:31:27.357Z","avatar_url":"https://github.com/krashish8.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# CSO102-Lab\nThis repository contains the Lab and Assignment files of the course Data Structures and Algorithms (CSO102) at IIT BHU Varanasi - Even Semester 2018-19\n\u003e **Guided By**: [Dr. Sanjay Kumar Singh](https://iitbhu.ac.in/dept/cse/people/skscse), Professor, CSE, IIT (BHU) Varanasi.\n\n**Contents:**\n\n1. [Lab 1](lab-01.c): Find mean, median, mode and standard deviation of a given dataset using an array.\n2. [Lab 2](lab-02.c): Find the highest number in a given matrix.\n3. [Lab 3](lab-03.c): Find the second largest element in an array.\n4. [Lab 4(i)](lab-04-i.c): Reverse (i) an array without using extra space.  \n   [Lab 4(ii)](lab-04-ii.c): Reverse (ii) a string without using extra space.\n5. [Lab 5](lab-05a.c): Display sine wave of given amplitude and no. of asterisks per 180 degree phase.\n6. [Lab 6](lab-06a.c): Implement two stack using 1-D array where the total size of both stacks are fixed but individual size may differ (use Dynamic Memory allocation and structure concepts)\n7. [Lab 7](lab-07.c): Use stack operations to convert given infix expression into its postfix equivalent. Implement the stack using an array.\n8. [Lab 8](lab-08.c): Use functions to perform the following operations:  \n\t(a) Create a singly linked list of integers.  \n\t(b) Delete a given integer from the above list.  \n\t(c) Display the contents of the above list after deletion\n9. [Lab 9(a)](lab-09a.c): Implement double ended queue ADT using (a) Array.  \n   [Lab 9(b)](lab-09b.c): Implement double ended queue ADT using (b) Doubly Linked List.\n10. [Lab 10](lab-10.c): Use functions to perform the following operations:  \n\t(a) Create a binary search tree of characters  \n\t(b) Traverse the binary tree recursively in postorder, preorder and inorder.\n11. [Lab 11](lab-11.c): Implement Priority Queue using BInary Heap.\n12. [Lab 12](lab-12.c): Check whether two trees are symmetric or not and also find that given tree is BST or not.\n13. [Lab 13](lab-13.c): Implement all the functions of a dictionary (ADT) using hashing.\n14. [Lab 14](lab-14.c): Implement graph traversal algorithms:  \n\t(i) Depth First search.  \n\t(ii) Breadth First search.  \n\t(iii) Topological sort on DAG using DFS\n\n* [DS Assignment](ds_assignment.c): Find LCA (Least Common Ancestor) of two given nodes in a tree given the child-parent relationship.\n* [Linked List Implementation](linked_list.c).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrashish8%2Fcso102-lab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkrashish8%2Fcso102-lab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkrashish8%2Fcso102-lab/lists"}