https://github.com/bilgehangecici/data-structures

Highly important projects written in C for understanding basics and fundamentals of Data Structures.
https://github.com/bilgehangecici/data-structures

algorithms c data-structures heap linked-list tree-structure

Last synced: 18 days ago
JSON representation

Highly important projects written in C for understanding basics and fundamentals of Data Structures.

• Host: GitHub
• URL: https://github.com/bilgehangecici/data-structures
• Owner: bilgehangecici
• License: gpl-3.0
• Created: 2019-12-16T17:22:21.000Z (about 5 years ago)
• Default Branch: master
• Last Pushed: 2020-01-14T13:01:29.000Z (almost 5 years ago)
• Last Synced: 2024-12-11T15:08:24.446Z (26 days ago)
• Topics: algorithms, c, data-structures, heap, linked-list, tree-structure
• Language: C
• Homepage:
• Size: 620 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Data Structures

  - This repository includes Data Structures projects.

  - For further informations about projects please visit Project Documentation section.

  

   # Project-1

   # Text representation with higher-order paths.

   * This project aims to represent these higher-order paths by using 

   Linked-Lists. Consequently, this project is a programming assignment in C, which aims to build an algorithm based on linked-lists that      will build an efficient representation of documents.

   

   # Project-2

   # Binary Search Tree topologies.

   * This project is a programming assignment in C which aims at developing an algorithm that

     builds a binary search tree (BST) from a given sequence and attemps to find other sequences

     that yield the same BST topology.

     

   # Project-3

   # Priority Queue in a Preemptive Scheduling System via Binomial Heaps.

   * This project aims that using binomial heaps to implement a priority queue in a preemptive scheduling system.  A preemptive scheduling    mechanism, shown in Fig. 1, operates as follows:

   

   Priority Queue in a Preemptive Scheduling System:

   

   ![Priority Queue in a Preemptive Scheduling System](https://drive.google.com/uc?export=view&id=11zespD-aFab0DwY9UaEyjbwNVvktduSb)