codehub27

              If you travel around the world. You need to book a ticket. Here, we implement the Ticket Counter simulation . You can add a ticket, get the ticket and view the available tickets of customers. C implementation : ·        Queue size is defined. ·        Queue structure is created and values are initialised. Is_empty() and is_full() functions are created. ·        To insert the values, enqueue() function is used. ·        To delete the values, deque() function is used. ·        If you want to see the customers details, print() is written. ·        In the main() function , the choice of customer is received. According to the choice, the values are displayed. Code: #include < stdio.h > #include < stdlib.h > //defines the maximum s...

               It is called deque . You can add or delete data in both the ends. It can be implemented by arrays or linked list . Key terms: Front: it represents the first element. Rear: it denotes the last element. Operations: Insert the data in front end. Delete data in front end. Insert the data in rear end. Delete the data in rear end. Display the elements. Let us implement the deque in C as follows. #include <stdio.h> #define MAX 9 int deque[MAX]; int d_front = -1, d_rear = -1; void insert_Front(int x) {     if ((d_front == 0 && d_rear == MAX-1) || (d_front == d_rear+1)) {         printf("Deque is full with data elements.\n");         return;     }     if (d_front == -1) {         d_front = d_rear = 0;     } else if (d_fr...

              Circular queue is a type of queue in which both of the end wrapped together to form a circle. It has two pointers rear and front. Features: It follows FIFO principle . Front points the element to be dequeued. Rear points the last inserted element. Functions in the circular Queue: ‘isFull()’ – Checks for queue is full or not. ‘isEmpty()’-Checks for emptiness. ‘peek()’ -View the front element without deleting. ‘Dequeue()’ – Deletes the front element. ‘Enqueue()’ – Inserts the value to the queue. Code implementation : #include <stdio.h> #define SIZE 6 int c_queue[SIZE]; int cq_front = -1, cq_rear = -1; // Check the queue is full or not int isFull() {     return (cq_front == (cq_rear + 1) % SIZE); } // Check the queue is empty or not int isEmpty() {     return (cq_front == -1); } // Add elements to the queue void enqueue(int element) {     ...

                Queue is a linear data structure which uses the principle FIFO(First In,First Out). Imagine a queue. The person who comes first, will leave first. Let us implement the Queue in C language . Queue implementation using Arrays :               This program starts by including the built-in header file. It has following steps. Steps: ·        It defines the maximum size as 6. ·        An array is created as integer with max size we defined already. ·        Front and rear are the two variables to represent front end and rear end. ·        First, we check the queue is full or not. Next, we check for empty or not. ·        ‘Enqueue()’ is the operation to insert the values to the queue. It checks for queue is full or n...

              Let us create a c program for balance parentheses . It uses Stack for expression evaluation . Program implementation: This program includes the built-in header files .   It defines the MAX value as 50. let us create a stack of MAX size. Initialise the value as -1. Create functions push(),pop(),isMatching(),is_Balanced(). ‘push()’ – it takes a data and insert into the stack. It checks the top value is equals to MAX-1. If it is equal. Then print the stack is overflow. Otherwise, it inserts the value into stack. ‘pop()’ – it deletes the data. It checks the top value is equal to -1. If yes, it returns 0.otherwise, it returns the top value. ‘isMatching()’ – it takes input as two characters. The characters are   checked with characters like ‘(‘,’)’,’{‘,’}’,’[‘,’]’. ‘is_Balanced()’ - it reads an expression. It separates the parenthesis of any type and stores in the stack. It uses ‘isMatching()’ function to check for match. If it...

               Stack is a linear data structure which stores data. It uses the LIFO(Last In First Out) principle. It has following functions. ‘push()’ – it inserts the data into stack. ‘pop()’ – it deletes the data from the stack. Program implementation: ·        This program includes the built-in header file . It defines the maximum size as 50. ·        Stack and top values are initialised. ·        To insert the value, check top value with maximum size to check for overflow . If it is overflow, the message is displayed. Otherwise, the data is inserted. ·        To delete the value, check for top value. If it is -1, then it is called underflow . Otherwise, the data is removed from the top. ·        Finally, data is displayed using print (). C Code : #include < stdio.h > ...