EmbLogic's Blog

Author Archives: Mannu Kaushik

IPC USING FIFOS AND SEMAPHORES

****************************************************************************************** RCS file: server.c,v Working file: server.c head: branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 0 description: Made a server file which takes request from client and forwards it to processing client Then it takes … Continue reading

Posted in Uncategorized | Leave a comment

IPC(Inter Process Communication) using pipes

RCS file: server.c,v Working file: server.c head: branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 0 description: made the server to perform three operations but can create file descriptors upto 100 ============================================================================= RCS file: add.c,v Working … Continue reading

Posted in Uncategorized | Leave a comment

Implemented Circular Queues with linked lists

#include<stdio.h> #include<stdlib.h> int flag=0; struct node { int val; struct node*next; }*front=NULL,*rear=NULL,*start=NULL; int count=0; int get_choice(int *); int create_node(); int enqueue(); int dequeue(); int display(); int main() { int choice=1; while(choice) { printf(“\n+++++++++MENU+++++++++\n”); printf(“1.CREATE NODE\n”); printf(“2.INSERT\n”); printf(“3.DELETE\n”); printf(“4.DISPLAY\n”); printf(“0.EXIT\n”); printf(“enter … Continue reading

Posted in Uncategorized | Leave a comment

Implemented Queues with linked lists

#include<stdio.h> #include<stdlib.h> struct node { int val; struct node*next; }*front,*rear,*start=NULL; int flag=0; int get_choice(int*); int create_node(); int enqueue(); int dequeue(); int display(); int main() { int choice=1; while (choice) { printf(“+++++++++++++++++++MENU++++++++++++++++++++++\n                “); printf(”                1.CREATE NODE                \n                “); printf(”                2.ENQUEUE                    \n                … Continue reading

Posted in Uncategorized | Leave a comment