{"id":20515751,"url":"https://github.com/paulthomas20002/s3-data-structures","last_synced_at":"2025-04-14T00:33:21.612Z","repository":{"id":43411346,"uuid":"430709484","full_name":"PaulThomas20002/S3-Data-Structures","owner":"PaulThomas20002","description":"KTU S3 CST 201","archived":false,"fork":false,"pushed_at":"2022-03-02T18:43:56.000Z","size":141,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-06-14T19:08:49.878Z","etag":null,"topics":["cst201","data-structures","ktu","module","s3"],"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/PaulThomas20002.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}},"created_at":"2021-11-22T13:05:07.000Z","updated_at":"2022-12-19T16:05:14.000Z","dependencies_parsed_at":"2022-08-26T20:56:37.024Z","dependency_job_id":null,"html_url":"https://github.com/PaulThomas20002/S3-Data-Structures","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PaulThomas20002%2FS3-Data-Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PaulThomas20002%2FS3-Data-Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PaulThomas20002%2FS3-Data-Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PaulThomas20002%2FS3-Data-Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/PaulThomas20002","download_url":"https://codeload.github.com/PaulThomas20002/S3-Data-Structures/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224846711,"owners_count":17379591,"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":["cst201","data-structures","ktu","module","s3"],"created_at":"2024-11-15T21:24:29.090Z","updated_at":"2024-11-15T21:24:29.673Z","avatar_url":"https://github.com/PaulThomas20002.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# S3-Data-Structures\nKTU S3 CST 201 \u0026 CSL 201\n\u003cbr\u003e\n\u003chr\u003e\nTo help 2nd Year KTU students\n\u003ch2\u003eCST201\u003c/h2\u003e\u003cbr\u003e\nDATA-STRUCTURES-SYLLABUS\u003cbr\u003e\n\u003cbr\u003e\u003cbr\u003e\nModule 1\n\u003cbr\u003e\nBasic Concepts of Data Structures\nSystem Life Cycle, Algorithms, Performance Analysis, Space Complexity, Time Complexity,\nAsymptotic Notation, Complexity Calculation of Simple Algorithms\n\u003cbr\u003e\u003cbr\u003e\nModule 2\n\u003cbr\u003e\nArrays and Searching\nPolynomial representation using Arrays, Sparse matrix, Stacks, Queues-Circular Queues, Priority\nQueues, Double Ended Queues, Evaluation of Expressions\nLinear Search and Binary Search\n\u003cbr\u003e\u003cbr\u003e\nModule 3\n\u003cbr\u003e\nLinked List and Memory Management\nSelf Referential Structures, Dynamic Memory Allocation, Singly Linked List-Operations on\nLinked List. Doubly Linked List, Circular Linked List, Stacks and Queues using Linked List,\nPolynomial representation using Linked List\nMemory allocation and de-allocation-First-fit, Best-fit and Worst-fit allocation schemes\n\u003cbr\u003e\u003cbr\u003e\nModule 4\n\u003cbr\u003e\nTrees and Graphs\nTrees, Binary Trees-Tree Operations, Binary Tree Representation, Tree Traversals, Binary Search\nTrees- Binary Search Tree Operations\nGraphs, Representation of Graphs, Depth First Search and Breadth First Search on Graphs,\nApplications of Graphs\n\u003cbr\u003e\u003cbr\u003e\nModule 5\n\u003cbr\u003e\nSorting and Hashing\nSorting Techniques – Selection Sort, Insertion Sort, Quick Sort, Merge Sort and Heap Sort\nHashing- Hashing Techniques, Collision Resolution, Overflow handling, Hashing functions –\nMid square, Division, Folding, Digit Analysis\n\u003cbr\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpaulthomas20002%2Fs3-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpaulthomas20002%2Fs3-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpaulthomas20002%2Fs3-data-structures/lists"}