#include <stdio.h> #include <stdlib.h> struct Queue{ int que[5]; int f,r; }; typedef struct Queue * QUEUE; void checkInsert(QUEUE q, int data){ int i, j; for…

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include<stdio.h> int stack[20]; int top = -1; void push(int x) { stack[++top] = x; } int pop() { return stack[top–]; } int main() { char…

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <stdlib.h> int top = -1; void push(int *stack,int data){ if (top==9){ printf(“Stack Overflown”); return; } *(stack+(++top))=data; printf(“Push Successfulln”); } void pop(int* stack){ …

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <stdlib.h> typedef struct student { char name[10]; int roll_no; int m1,m2,m3; float avg_marks; } STD; void read(int,STD *); void display(int, STD *); …

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <stdlib.h> struct Queue{ int que[5]; int f,r; }; typedef struct Queue * QUEUE; void insertFront(QUEUE q){ if (q->f==0&&q->r==4){ printf(“Queue Overflown”); return; } …

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *right, *left; }; typedef struct node* NODE; NODE createNode(int data){ NODE temp = (NODE)malloc(sizeof(struct…

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <stdlib.h> typedef struct student { char name[10]; int roll_no; int m1,m2,m3; float avg_marks; } STD; void read(int,STD *); void display(int, STD…

Rich Engineer - Study Materials, Tutorials, Updates and much more!

#include <stdio.h> #include <ctype.h> #include <string.h> int stack[10]; int tos =-1; void push(char x){ stack[++tos] = x; } int pop(){ return stack[tos–]; } void main(){ …

Rich Engineer - Study Materials, Tutorials, Updates and much more!