Double Ended Queues (Dequeue) Program to implement Dequeue (Double Ended Queues) using Arrays with front always at zero /*Implementation of De-queue using […]
Queues Program to implement Linear Queues using Linked list using global front and rear pointers /*Implementation of Linear Queues using Linked List […]
Queues Program to implement Linear Queues using Linked List /*Implementation of Linear Queues using Linked List*/ #include <stdio.h> #include <conio.h> #include <stdlib.h> […]
Queues Program to implement a Queue using Array with front always at zero /*Implementation of queues using arrays*/ /*Queue implementation with front […]
Queues Introduction Representation Operations Implementation Simple queue With front always at zero Linked queue Dequeue Priority Queues Max Priority Min Priority Queues […]
Recursion Program to solve Towers of Hanoi problem #include <stdio.h> #include <conio.h> void hanoi(int num_disks,char *src,char *tmp,char *trgt); void main() { int […]
Recursion Program to compute factorial of a given number #include <stdio.h> #include <conio.h> /*Recursive Definition*/ /*int factorial(int n) {if(n==0) return 1; else […]