A data structure is an arrangement of data in a computer's memory or even disk storage. It has a different way of storing and organizing data in a computer so that it can used efficiently. Different kind of Data structure is used in different application. For example, B-tree is widely used in implementation of databases.
Data Segment in sub-categories in two parts
Know what is data structure, dynamic memory allocation. Now in this tutorial you will see the how we declare a pointer variable. How it works with a very simple example.
Pointer and Structure in C
Structures in C defines the group of contiguous (adjacent) fields, such as records or control blocks. A structure is a collection of variables grouped together under a single name. It provides an elegant and powerful way for keeping related data together.
Linear and Non-Linear Data Structure in C
Know the difference between Linear and Non-Linear Data Structure in C.
Array Implementation in C
Learn how to implement an array in C. There are two function in this given example one for reading the array element and other for writing on console.
Sum of array element in C
Know how to get the sum of each element of an array. There are two function in this given example one for reading the array element and other for writing on console.
Addition of two arrays element in C
Know how to get the sum of each element of an array. There are three function in this given example one for reading the array element, second for writing on console and last for addition of both array's element.
Inverse of an array in C
Know how to inverse an array in c language. There are three function in this given example one for reading the array element, second for writing on console and last for inverse of an array.
Merge of two arrays in C
Know how to merge two array in c language. There are four function in this given example one for reading the array element, second for writing on console and third for sorting of both array and last for merge of two array into one.
Overview of Linked List
Know what is linked list and what are its types.
Singly Linked List
Demonstrate the implementation of singly linked list.
Doubly Linked List
Demonstrate how to implement doubly linked list.
Circular Linked List
Demonstrate how to implement circular linked list.
Count number of nodes
Demonstrate how to count the number of nodes present in the linked list.
Split a list into two equal size list
Demonstrate how to splits the list into two equal size list having same data inside.
Merge two list into a single list
Demonstrate the merging of two link list into one single.
Stack
The stack is one of the most important data structures in computer science. A stack is a last-in first-out data structure (LIFO).
Push and Pop operation of stack.
Demonstrate the push and pop operation of stack using array.
Push and Pop operation of stack using linked list.
The fundamental operation of stack is push and pop. The term push is use to place some data element into the stack and pop is use to remove some data element from the stack.
Queue implementation using array.
Demonstrate how to insert and delete element in the queue using array.
Queue implementation using linked list.
Demonstrate how to implement queue using linked list.
Circular queue implementation using array.
Demonstrate the circular queue implementation using array in c language.
Tree data structure
Define tree data structure and display how to make a tree.
Representing Graph using adjacency list & perform DFS & BFS
A graph is a collection of nodes and edges.
Data Structure in C
A memory play a vital role in c because all variable you declare are at first stored in the memory. Some memory allocation is done at compile time and some at runtime. Memory which is allocated and de-allocated during the execution of the program is known as dynamic memory. Memory span and shrink as per application requirement and this is one of major advantage of pointer.
A memory can be categories in following segments
| Text Segment |
| Data Segment |
| Free Space |
| Stack Segment |
| Static Segment |
| Heap Segment |
The Static Segment hold the global variables and the Heap Segment hold the dynamic variable. Dynamic memory allocation is done by using malloc() funtion in C.
In this tutorial you will learn about Pointer, Linked List, Stacks, Queues, Trees, and Graphs which are related with the data structures.
Pointer in CKnow what is data structure, dynamic memory allocation. Now in this tutorial you will see the how we declare a pointer variable. How it works with a very simple example.
Pointer and Structure in C
Structures in C defines the group of contiguous (adjacent) fields, such as records or control blocks. A structure is a collection of variables grouped together under a single name. It provides an elegant and powerful way for keeping related data together.
Linear and Non-Linear Data Structure in C
Know the difference between Linear and Non-Linear Data Structure in C.
Array Implementation in C
Learn how to implement an array in C. There are two function in this given example one for reading the array element and other for writing on console.
Sum of array element in C
Know how to get the sum of each element of an array. There are two function in this given example one for reading the array element and other for writing on console.
Addition of two arrays element in C
Know how to get the sum of each element of an array. There are three function in this given example one for reading the array element, second for writing on console and last for addition of both array's element.
Inverse of an array in C
Know how to inverse an array in c language. There are three function in this given example one for reading the array element, second for writing on console and last for inverse of an array.
Merge of two arrays in C
Know how to merge two array in c language. There are four function in this given example one for reading the array element, second for writing on console and third for sorting of both array and last for merge of two array into one.
Overview of Linked List
Know what is linked list and what are its types.
Singly Linked List
Demonstrate the implementation of singly linked list.
Doubly Linked List
Demonstrate how to implement doubly linked list.
Circular Linked List
Demonstrate how to implement circular linked list.
Count number of nodes
Demonstrate how to count the number of nodes present in the linked list.
Split a list into two equal size list
Demonstrate how to splits the list into two equal size list having same data inside.
Merge two list into a single list
Demonstrate the merging of two link list into one single.
Stack
The stack is one of the most important data structures in computer science. A stack is a last-in first-out data structure (LIFO).
Push and Pop operation of stack.
Demonstrate the push and pop operation of stack using array.
Push and Pop operation of stack using linked list.
The fundamental operation of stack is push and pop. The term push is use to place some data element into the stack and pop is use to remove some data element from the stack.
Queue implementation using array.
Demonstrate how to insert and delete element in the queue using array.
Queue implementation using linked list.
Demonstrate how to implement queue using linked list.
Circular queue implementation using array.
Demonstrate the circular queue implementation using array in c language.
Tree data structure
Define tree data structure and display how to make a tree.
Representing Graph using adjacency list & perform DFS & BFS
A graph is a collection of nodes and edges.
NEXT
0 comments:
Speak up your mind
Tell us what you're thinking... !