Mario Kart DS (EU) reverse-engineering work: ASM-hacking and other tools
-
Updated
Jan 24, 2025 - C
#
ds
Here are 44 public repositories matching this topic...
Contains solutions for all DS Lab Programs.
-
Updated
Apr 29, 2022 - C
TWAIN Data Source that capturing video from a USB web camera and making snapshots using it
-
Updated
Nov 24, 2020 - C
This is a simple implementation of Circular Doubly Linked-List in C. Circular Doubly Linked-List is a data structure that is a combination of a doubly linked list and a circular linked list. It is a linked list where all nodes are connected to each other. It is a circular linked list because all nodes are connected to each other.
c data-structure linked-list linkedlist datastructure ds circular-linked-list circularlinkedlist circular-doubly-linked-list circular-linkedlist circular-doubly circular-doubly-linkedlist
-
Updated
Dec 19, 2022 - C
cisco-hdlc: Linux kernel module for Cisco HDLC (ds) encapsulation
-
Updated
Dec 18, 2021 - C
This is a simple C program to check if a binary tree is full or not.
-
Updated
Jan 21, 2023 - C
C Programs
c sorting data-structures sorting-algorithms searching-algorithms c-language ds daa searching-techniques design-and-analysis-of-algorithms
-
Updated
Aug 11, 2022 - C
This repo will consists of the basic programs and the concepts a programmer need to know in order to master DSA
-
Updated
Apr 18, 2022 - C
This is a simple implementation of Binary Search Tree (BST) in C language. All In-order, Pre-order, and Post-order traversal functions are implemented.
c tree data-structure traversal binary-search-tree binary-tree bst datastructure ds postorder preorder inorder postorder-traversal
-
Updated
Feb 3, 2023 - C
This is a C implementation of a sparse polynomial linked-list. This is a good example of how to use a linked-list in C. By using a linked-list, we can store a sparse polynomial in a memory efficient way. Sparse polynomials are polynomials that have a lot of terms with a coefficient of 0.
c algorithm algorithms sparse polynomial datastructure ds algorithms-and-data-structures sparse-polynomial sparsepolynomial c-polynomial polynomial-c sparsepolynomial-c c-sparsepolynomial c-sparse-polynomial sparse-polynomial-c
-
Updated
Dec 10, 2022 - C
This is a simple implementation of a doubly linked-list in C. Doubly linked-lists are a type of data structure that are similar to singly linked-lists, but they have a pointer to the previous node in addition to the next node. This allows for traversal in both directions.
c data-structure linked-list linkedlist datastructure doublylinkedlist ds doubly-linked-list doubly doublylinkedlist-operations doubly-linked-lists
-
Updated
Jan 5, 2023 - C
A dynamic workspace documenting my learning journey into embedded systems through practical tasks and hands-on projects as part of the Embedded Systems Circle in IEEE Mancsc Society Chapter.
-
Updated
Feb 25, 2025 - C
pxtone music playback for Nintendo DS
-
Updated
Aug 20, 2023 - C
This is a simple implementation of a circular linked-list in C. Circular linked-lists are a type of linked-list where the last node points to the first node. This is useful for implementing queues and stacks. This implementation is a doubly linked-list, meaning that each node has a pointer to the next node and a pointer to the previous node.
c data-structure linked-list linkedlist circular datastructure ds circular-linked-list circular-linkedlist
-
Updated
Jan 5, 2023 - C
Data Structures and Programming with C
c tree algorithm linked-list stack queue graph dsp dfs bfs radix-sort ds algorithms-and-data-structures adjacency-matrix adjacency-list
-
Updated
May 13, 2021 - C
Improve this page
Add a description, image, and links to the ds topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the ds topic, visit your repo's landing page and select "manage topics."