An ebook reader for the Nintendo DS

Mario Kart DS (EU) reverse-engineering work: ASM-hacking and other tools

VTU 3rd sem CSE DS LAB Programs.

Contains solutions for all DS Lab Programs.

TWAIN Data Source that capturing video from a USB web camera and making snapshots using it

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.

VTU 3rd Sem DS Lab Programs

cisco-hdlc: Linux kernel module for Cisco HDLC (ds) encapsulation

Collection of all laboratory work for the Information Technology branch at Manipal Institute of Technology.

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.

中国科学院大学(UCAS)2020年春季学期数据结构课程作业

C Programs

pxtone music playback for Nintendo DS

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.

This is a simple C program to check if a binary tree is full or not.

CS205 Data structures

This contains my codes for PSUC, DSD, OOP, DS, DBS, ES, AL, CN, OS, SE, WP, PCAP,CD Labs.

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.

This repository contains solutions to the Data Structures (DS) Lab programs as a part of the B.Tech. curriculum in the second year.

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.