Never cease to pursue knowledge
Never cease to pursue knowledge
Start learning today with our wide range of courses taught by industry experts. Gain new skills, advance your career, or explore new interests.
Browse CoursesIn DEQUE, insertion and deletion operations are performed at both ends of the Queue. Exceptional Condition of DEQUE Here insertion is allowed at one end and deletion is allowed at both ends. Deletion Insertion Front Rear Here insertion is allowed at both ends and deletion is allowed at one end. Insertion Deletion Front Rear Operations […]
Here the Queue space is utilized Operations on Circular Queue Fundamental operations performed on the Circular Queue are Formula to be used in Circular Queue For Enqueue Rear = ( Rear + 1) % ArraySize For Dequeue Front = ( Front + 1) % ArraySize (i) Circular Queue Enqueue Operation It is same as […]
Drawbacks of Queue (Linear Queue) To overcome the drawback of this linear Queue, we use Circular Queue. CIRCULAR QUEUE In Circular Queue, the insertion of a new element is performed at the very first location of the queue if the last location of the queue is full, in which the first element comes just after […]
Front = NULL & Rear = NULL Declaration for Linked List Implementation of Queue ADT struct node; typedef struct node * Queue; typedef struct node * position; int IsEmpty (Queue Q); Queue CreateQueue (void); void MakeEmpty (Queue Q); void Enqueue (int X, Queue Q); void Dequeue (Queue Q); struct node { int data ; position […]
#include<stdio.h> #include<conio.h> #define SIZE 5 int front = – 1; int rear = – 1; int q[SIZE]; void insert( ); void del( ); void display( ); void main( ) { int choice; clrscr( ); do { printf(“\t Menu”); printf(“\n 1. Insert”); printf(“\n 2. Delete”); printf(“\n 3. Display “); printf(“\n 4. Exit”); printf(“\n Enter Your Choice:”); […]
QUEUES: Front Pointer:- It always points to the first element inserted in the Queue. Rear Pointer:- It always points to the last element inserted in the Queue. For Empty Queue:- Front (F) = – 1 Rear (R) = – 1 Operations on Queue Fundamental operations performed on the queue are Exceptional Conditions of Queue Implementation […]
When a call is made to a new function all the variables local to the calling routine need to be saved, otherwise the new function will overwrite the calling routine variables. Similarly the current location address in the routine must be saved so that the new function knows where to go after it is completed. […]
Towers of Hanoi can be easily implemented using recursion. Objective of the problem is moving a collection of N disks of decreasing size from one pillar to another pillar. The movement of the disk is restricted by the following rules. Rule 1 : Only one disk could be moved at a time. Rule 2 : […]
There are 3 types of Expressions INFIX The arithmetic operator appears between the two operands to which it is being applied. POSTFIX The arithmetic operator appears directly after the two operands to which it applies. Also called reverse polish notation PREFIX The arithmetic operator is placed before the two operands to which it applies. Also […]
The following are some of the applications of stack: struct node; typedef struct node *stack; typedef struct node *position; stack S; struct node{ int data; position next;}; int IsEmpty(Stack S); void Push(int x, Stack S); void Pop(Stack S); int TopElement(Stack S); Routine to check whether the stack is empty int IsEmpty( Stack S) { if […]
Learn the fundamentals of programming with Python in this beginner-friendly course.
Master the basics of data analysis, visualization, and machine learning.
Build modern websites with HTML, CSS, JavaScript and popular frameworks.
Learn SEO, social media marketing, email campaigns and analytics.