{"id":20392123,"url":"https://github.com/abhinav9444/daa-lab-codes","last_synced_at":"2025-12-04T10:00:54.153Z","repository":{"id":262359608,"uuid":"842330412","full_name":"abhinav9444/DAA-Lab-Codes","owner":"abhinav9444","description":null,"archived":false,"fork":false,"pushed_at":"2024-11-13T02:12:36.000Z","size":404,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-15T10:25:56.170Z","etag":null,"topics":["algorithms","c","computer-science","data-structures","data-structures-and-algorithms","design-and-analysis-of-algorithms","dsa-algorithm"],"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/abhinav9444.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":"2024-08-14T06:12:02.000Z","updated_at":"2024-11-13T02:12:39.000Z","dependencies_parsed_at":"2024-11-12T04:02:37.064Z","dependency_job_id":null,"html_url":"https://github.com/abhinav9444/DAA-Lab-Codes","commit_stats":null,"previous_names":["abhinav9444/daa-lab-codes"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav9444%2FDAA-Lab-Codes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav9444%2FDAA-Lab-Codes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav9444%2FDAA-Lab-Codes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/abhinav9444%2FDAA-Lab-Codes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/abhinav9444","download_url":"https://codeload.github.com/abhinav9444/DAA-Lab-Codes/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241940576,"owners_count":20045883,"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":["algorithms","c","computer-science","data-structures","data-structures-and-algorithms","design-and-analysis-of-algorithms","dsa-algorithm"],"created_at":"2024-11-15T03:39:33.185Z","updated_at":"2025-12-04T10:00:54.005Z","avatar_url":"https://github.com/abhinav9444.png","language":"C","readme":"# Design and Analysis of Algorithms Laboratory (CS39001)\n\nWelcome to the **Design and Analysis of Algorithms Laboratory** repository ! This repository contains a collection of all algorithms and data structures that I have implemented and analyzed in my DAA lab sessions. It serves as a digital archive of the work done in the laboratory sessions as well as a comprehensive resource for learning and exploring various algorithmic techniques and their complexities.\n\n## 📚 Overview\nThe repository features a wide range of classic and modern algorithms, covering various aspects of algorithm design and analysis.\nIn this laboratory, you'll find :\n- **Algorithm Implementations:** A range of classic and modern algorithms implemented in different programming languages.\n- **Data Structures:** Implementations of fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs.\n- **Complexity Analysis:** Detailed analyses of time and space complexities for various algorithms.\n- **Visualization Tools:** Tools and scripts to visualize the behavior and performance of algorithms.\n\n## 🖥️ Languages Used\nThe languages used throughout the lab are :\n - C\n - Python\n\n# 📂DAA Lab Sessions Index\n  \n ## Lab Session 0 : Basics and Fundamentals\n\n| **S.No.** | **Problem Statement**            | **Solution File in C**             |\n|-----------|----------------------------------|-------------------------------|\n| **0.1**     | Write a Program to Count no. of digits in a number                                         | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.1.c)\u003c/p\u003e|\n| **0.2**     | Take input of 3 numbers and find max among 3 numbers.                                      | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.2.c)\u003c/p\u003e|\n| **0.3**     | Take one sentence as input and store each word in array and display the 4th element (word) | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.3.c)\u003c/p\u003e|\n| **0.4**     | Take 1 integer as input, count the frequency of each digit in the number                   | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.4.c)\u003c/p\u003e|\n| **0.5**     | Write a program to find the sum of the digits repetitively until single digit.             | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.5.c)\u003c/p\u003e|\n\n## Lab Session 1 : Revision of Data Structures\n\n| **S.No.** | **Problem Statement**            | **Solution File in C**             |\n|-----------|----------------------------------|-------------------------------|\n| **1.1**     | WAP to find out the second smallest and second largest element stored in an array of n integers.                                   | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.1.c)\u003c/p\u003e|\n| **1.2**     | Given an array arr[] of size N, find the prefix sum of the array. A prefix sum array is another array prefixSum[] of the same size, such that the value of prefixSum[i] is arr[0] + arr[1] + arr[2] . . . arr[i].                     | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.2.c)\u003c/p\u003e|\n| **1.3**     | Write a program to read ‘n’ integers that must contain some duplicate values and store them into an array. Perform the following operations on the array. a)Find out the total number of duplicate elements. b)Find out the most repeating element in the array. | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/0.3.c)\u003c/p\u003e|\n\n ## Lab Session 8 : Dynamic Programming\n\n| **S.No.** | **Problem Statement**            | **Solution File in C**             |\n|-----------|----------------------------------|-------------------------------|\n| **8.1**     | Write a program to implement the matrix chain multiplication problem using M-table \u0026 S-table to find optimal parenthesization of a matrix-chain product. Print the number of scalar multiplications required for the given input.                                        | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/8.1.py)\u003c/p\u003e|\n| **8.2**     | Write a program to find out the Longest Common Subsequence of two given strings. Calculate length of the LCS.                                      | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/8.2.py)\u003c/p\u003e|\n\n## Lab Session 9 : Dynamic Programming -  All Pair Shortest path\n\n| **S.No.** | **Problem Statement**            | **Solution File in C**             |\n|-----------|----------------------------------|-------------------------------|\n| **9.1**   | Given a directed weighted graph G (V, E) where weight indicates distance. Vertices will be numbered consecutively from 1 to n (user input), and edges will have varying distances or lengths. ●Determine the length of the shortest path between every pair of vertices using Floyd-Warshall’s algorithm. ●Display the intermediate vertices on the shortest-path from the given pair of vertices (u,v).    Note# The graph G can be read from console input as cost adjacency matrix. The expected output could be a shorted-path weight matrix and the path consisting of intermediate vertices.     | \u003cp align=\"center\"\u003e[Solution](./Lab-Codes/9.1.py)\u003c/p\u003e|\n\n## 🛠️ Getting Started\n\nTo get started with this repository, follow these steps:\n\n1. **Clone the Repository:**\n   ```bash\n   git clone https://github.com/yourusername/design-analysis-algorithms-lab.git\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhinav9444%2Fdaa-lab-codes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabhinav9444%2Fdaa-lab-codes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabhinav9444%2Fdaa-lab-codes/lists"}