RCS file for stacks: RCS file: stack_using_array.c,v Working file: stack_using_array.c head: 1.18 branch: locks: strict root: 1.18 access list: symbolic names: keyword substitution: kv total revisions: 18; selected revisions: 18 description: gave the basic program for stack. declared prototype for … Continue reading →

RCS file: file.c,v Working file: file.c head: 1.16 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 16; selected revisions: 16 description: starting —————————- revision 1.16 date: 2014/07/21 12:28:16; author: amardeep; state: Exp; lines: +2 -2 add … Continue reading →

RCS file: ./17_add_matrix.c,v Working file: ./17_add_matrix.c head: 1.2 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 2;     selected revisions: 2 description: gave prototype for function get_matrices(). gave prototype for function add_matrices(). gave prototype for function disp_matrices(). … Continue reading →

RCS file: cw2.c,v Working file: cw2.c head: branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 0 description: link list is completed =============================================================================

RCS file: ./9_factorial.c,v Working file: ./9_factorial.c head: 1.1 branch: locks: strict root: 1.1 access list: symbolic names: keyword substitution: kv total revisions: 1;     selected revisions: 1 description: gave prototype for factorial(). gave defination for function factorial(). —————————- revision 1.1    locked … Continue reading →

RCS file: 10_fibonacci.c,v Working file: 10_fibonacci.c head: 1.2 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 2;     selected revisions: 2 description: write basic program for finding fibonacci series upto n terms. —————————- revision 1.2 date: 2014/07/21 … Continue reading →

1 2 RCS file: main.c,v 3 Working file: main.c 4 head: 1.10 5 branch: 6 locks: strict 7 root: 1.10 8 access list: 9 symbolic names: 10 keyword substitution: kv 11 total revisions: 10;    selected revisions: 10 12 description: 13 … Continue reading →

I have created master array successfully.

1)SOURCE CODE: #include”header.h” int f_open(char *); char *master_arr(int,char*,char *); int main(int argc,char *argv[]) { int f,i=0,k=1,j; char *buff,*ma,c,*mad; buff=malloc(2); ma=malloc(1); f=f_open(argv[1]); if(f<0) { perror(“open”); exit(EXIT_FAILURE); } mad=master_arr(f,buff,ma); printf(“\nMASTERARRAY:\n%s”,mad); return 0; } int f_open(char *arg) { int fd; fd=open(arg,O_RDONLY); return fd; … Continue reading →

main #include”header.h” int main() { int choice; struct node *start; start = (struct node *)malloc(sizeof(struct node)); start->next = NULL; start->prev = NULL; while(1) {    choice = get_choice(); operation(choice,&start); } return 0; }   FUNCTIONS DEFINITIONS #include”header.h” struct node *top=NULL; int … Continue reading →

RCS file: main.c,v Working file: main.c head: 1.3 branch: locks: strict root: 1.3 access list: symbolic names: keyword substitution: kv total revisions: 3;    selected revisions: 3 description: created master array which contains distinct characters of file which is opened —————————- … Continue reading →

RCS file: mdc.c,v Working file: mdc.c head: 1.6 branch: locks: strict access list: symbolic names: keyword substitution: kv total revisions: 6;    selected revisions: 6 description: Started the project “muldiple data compression & encryption. Read file with open command. —————————- revision … Continue reading →

HEADER.h #include<stdio.h> #include<stdlib.h> struct node { int info; struct node * next; }; int get_choice(); struct node * operation(int, struct node *); struct node * create_node(struct node *); struct node * insert_node(struct node*); struct node * insert_beg(struct node*); struct node … Continue reading →

#include #include #include char *input(); int cmp(char * ,char *); int main() { char *a,*b; int i; printf(“Enter 1st string:”); a=input(); printf(“Enter 2nd string:”); b=input(); i=cmp(a,b); printf(“Comparision is=%d\n”,i); } char *input() { char *s1,ch; int i=0; s1=(char *)malloc(sizeof(char)); while(1) { … Continue reading →