PCMB to Engineering is one change most of us have to experience. Are you planning to pursue a degree in computer science or IT engineering?

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

I think you have your Google DSC interview soon or maybe you are preparing for the next interview to join Google developer student clubs in your college.

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> int max; struct Queue{ int *que; int f,r; }; typedef struct Queue * QUEUE; void insert(QUEUE q){ if ((q->f==0&&q->r==max-1)||(q->f==q->r+1)){ printf(“Queue…

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

#include <stdio.h> #include <semaphore.h> #include <pthread.h> #include <stdlib.h> #include <time.h> pthread_mutex_t mutex; sem_t empty, full; int in=0, out=0, buffer[5]; void *producer(void *pno){ for(int i=0;i<5;i++){ sem_wait(&empty); pthread_mutex_lock(&mutex); …

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 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> struct node{ int data; struct node* rlink, *llink; }; typedef struct node* NODE; NODE createNode(){ NODE temp = (NODE)malloc(sizeof(struct node)); temp->llink…

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

#include <stdio.h> #include <stdlib.h> struct process{ int pid,at,bt,tt,wt,ct; }; void main(){ int n,i; printf(“No. of processes: “); scanf(“%d”,&n); struct process p[n]; int burstRemain[n]; printf(“nPIDtATtBTn”); for(i=0;i<n;i++){ …

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

#include <stdio.h> #include <stdlib.h> int top = -1; struct node{ int info; struct node* link; }; typedef struct node* NODE; NODE push(NODE stack,…

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