Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
A circular queue can be implemented through arrays or linked lists. Program 6 gives the array implementation of any circular queue.
Program 6: Array implementation of any Circular queue
include "stdio.h"
void add(int);
void deleteelement(void);
int max=10; /*the maximum limit for queue has been set*/
static int queue[10];
int front=0, rear=-1; /*queue is initially empty*/
void main()
{
int choice,x;
printf ("Enter # for insertion & $ for removal of front the queue and * for exit");
printf("Enter your choice");
scanf("%d",&choice);
switch (choice)
case 1 :
printf ("Enter element for insertion in queue:");
scanf("%d",&x);
add(x);
break;
case 2 :
deleteelement();
}
void add(int y)
if(rear == max-1)
rear = 0;
else
rear = rear + 1;
if( front == rear && queue[front] != NULL)
printf("Queue Overflow");
queue[rear] = y;
void deleteelement()
int deleted_front = 0;
if (front == NULL)
printf("Error - Queue empty");
deleted_front = queue[front];
queue[front] = NULL;
if (front == max-1)
front = 0;
front = front + 1;
What is an Algorithm? An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for getting a needed output for any legitimate input in a finite amoun
First - Fit Method: - The free list is traversed sequentially to search the 1st free block whose size is larger than or equal to the amount requested. Once the block is found it
What is AVL Tree? Describe the method of Deletion of a node from and AVL Tree ?
The time required to delete a node x from a doubly linked list having n nodes is O (1)
What is an algorithm? What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many
Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer? O (1)
There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo
How sparse matrix stored in the memory of a computer?
Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd