Deque Data Structure In this tutorial, you will learn what a double ended queue (deque) is. Also, you will find working examples of different operations on a deque in C. Deque or Double Ended Queue is a type of queue in which insertion and removal of elements can be performed from either from the front or …
Priority Queue In this tutorial, you will learn what priority queue is. Also, you will learn about it’s implementations in C. A priority queue is a special type of queue in which each element is associated with a priority and is served according to its priority. If elements with the same priority occur, they …
Circular Queue Data Structure In this tutorial, you will learn what a circular queue is. Also, you will find implementation of circular queue in C. Limitation of the regular Queue As you can see in the above image, after a bit of enqueuing and dequeuing, the size of the queue has been reduced. The …
Types of Queue In this tutorial, you will learn different types of queue along with illustration. A queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who gets the ticket. There are four different types …
Queue Data Structure In this tutorial, you will learn what a queue is. Also, you will find implementation of queue in C. A queue is a useful data structure in programming. It is similar to the ticket queue outside a cinema hall, where the first person entering the queue is the first person who …
Stack Data Structure In this tutorial, you will learn about the stack data structure and it’s implementation in C. A stack is a useful data structure in programming. It is just like a pile of plates kept on top of each other. Stack representation similar to a pile of plate Think about the things …
Divide and Conquer Algorithm In this tutorial, you will learn how the divide and conquer algorithm works. Also, you will find the comparison between divide and conquer approach and other approach to solve a recursive problem. A divide and conquer algorithm is a strategy of solving a large problem by breaking the problem into smaller sub-problems …
What is an Algorithm? In this tutorial, we will learn what algorithms are with the help of examples. An algorithm is a set of well-defined instructions in sequence to solve a problem. Qualities of a good algorithm Input and output should be defined precisely. Each step in the algorithm should be clear and unambiguous. …
Huffman Coding In this tutorial, you will learn how Huffman Coding works. Also, you will find working examples of Huffman Coding in Python. Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by David Huffman. Huffman Coding is generally useful to …
Prim’s Algorithm In this tutorial, you will learn how Prim’s Algorithm works. Also, you will find working examples of Prim’s Algorithm in Python. Prim’s algorithm is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex has …