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;
As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a
Define about the Structure - Container - Some containers hold elements in some sort of structure, and some don't. Containers with no structure include bags and sets. Containe
1. You are required to hand in both a hard copy and an electronic copy of the written report on the project described in A, including all the diagrams you have drawn. 2. You
Q. Explain the term hashing? Explain any five well known hash functions. Ans: Hashing method provides us the direct access of record from the f
Explain in detail the algorithmic implementation of multiple stacks.
Example 1: Following are Simple sequence of statements Statement 1; Statement 2; ... ... Statement k; The entire time can be found out through adding the times for
What are the structures used in file-system implementation? Several on-disk and in-memory structures are used to execute a file system a. On-disk structure include P
Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree. A n s . The algorithm to check whether a Binary tree is as Binary Search
Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr
In what ways we can get the context sensitive F1 help on a field?' Data element documentation. Data element additional text in screen painter. Using the process on help r
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