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;
The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog
how to write a pseudo code using Kramer''s rule
Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of optimal solutions to its subinstances.
Q. Write down an algorithm to sort a given list by making use of Quick sort method. Describe the behaviour of Quick sort when input given to us is already sorted.
Q. In the given figure find the shortest path from A to Z using Dijkstra's Algorithm. Ans: 1. P=φ; T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)
Run time complexity of an algorithm is depend on
How can the third dimension be displayed on the screen The main problem in visualization is the display of three-dimensional objects and scenes on two-dimensional screens. How
Two-dimensional array is shown in memory in following two ways: 1. Row major representation: To achieve this linear representation, the first row of the array is stored in th
Define min-heap A min-heap is a complete binary tree in which each element is less than or equal to its children. All the principal properties of heaps remain valid for min-hea
insertion and deletion in a tree
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