BITS PILANI, DUBAI CAMPUS DUBAI INTERNATIONAL ACADEMIC CITY, DUBAI FIRST SEMESTER

Transcription

1 BITS PILANI, DUBAI CAMPUS DUBAI INTERNATIONAL ACADEMIC CITY, DUBAI FIRST SEMESTER COURSE : COMPUTER PROGRAMMING (CS F111) COMPONENT : Tutorial# 7 (SOLUTIONS) DATE : 06-DEC-2017 Answer 1 enum color RED, GREEN, YELLOW; enum type Tenis, Cricket, TT, Squash; enum manufacturing Cosco, SS, Dunhil; struct ball enum color c; enum type t; enum manufacturing m; float price; ; main() struct ball b; b.c=yellow; b.t=tt; b.m=ss; b.price=6.85; printf("\n\n%d\n%d\n%d\n%f\n\n",b.c,b.t,b.m,b.price); Answer 2 #include <stdio.h> #include <stdlib.h> #include <assert.h> struct node; typedef struct node NODE; typedef NODE *LINK; typedef NODE *NODEPTR; struct node int data; LINK next; ; typedef struct LINK head; int size; CS F111 COMPUTER PROGRAMMING Page 1 of 7

2 LIST; NODEPTR createnode(int item) NODEPTR node = (NODEPTR) malloc(sizeof(node)); assert(node); node->data = item; node->next = NULL; void initlist(list *list) NODEPTR node = createnode(0); list->head = node; list->size = 0; void insert (LIST *list, int item) NODEPTR newnode = createnode(item); NODEPTR temp = list->head; while (temp->next ) temp->next = newnode; list->size++; void display(list *list) NODEPTR temp = list->head->next; printf ("List has %d element(s) --: ", list->size ); while (temp ) printf("%d ", temp->data); printf("\n"); NODEPTR search(list *list, int item) NODEPTR temp = list->head->next; printf ("List has %d element(s)\n", list->size ); if (!list->size) return NULL; /* nothing to search */ while (temp ) if (item == temp->data) return temp; return NULL; /* element not found */ int delete(list *list, int item) NODEPTR prev = list->head, temp = prev->next; printf ("List has %d element(s)\n", list->size ); if (!list->size) return 0; /* nothing to delete */ while (temp ) if (item == temp->data) CS F111 COMPUTER PROGRAMMING Page 2 of 7

3 prev->next = temp->next; free(temp); list->size--; return 1; prev = temp; return 0; /* element not found */ main() int op, item, quit = 0; LIST list; initlist(&list); do printf("\n1.insert\n2.search\n3.delete\n4.display\n5.quit\n"); printf("enter option : "); scanf("%d", &op); switch(op) case 1: printf("enter item to inserted: "); scanf("%d", &item); insert(&list, item); case 2: printf("enter item to be searched: "); scanf("%d", &item); printf ("%d %s\n", item, search(&list, item)? "Found" : "Not Found"); case 3: printf("enter item to be deleted: "); scanf("%d", &item); printf ("%d %s\n", item, delete(&list, item)? "Deleted" : "Not Found"); case 4: display(&list); case 5: quit = 1; default: printf("illegal Option\n"); /* of switch */ getchar(); while (!quit); Answer 3 #include<stdio.h> main(int argc, char *argv[]) FILE *f; char c; int space=0,newline=0,semi=0; f=fopen(argv[1],"r"); if(f==null) CS F111 COMPUTER PROGRAMMING Page 3 of 7

4 printf("file opening error\n"); exit(0); c=fgetc(f); while(c!=eof) if(c==' ') space++; else if(c==';') semi++; else if(c=='\n') newline++; c=fgetc(f); printf("\n\nspaces=%d\nsemi Colon=%d\nNewline=%d\n\n",space,semi,newline); fclose(f); Answer 4 #include<stdio.h> #include<stdlib.h> struct node; typedef struct node NODE; typedef NODE *LINK; struct node int data; LINK next; *first=null; typedef struct LINK head; int size; LIST; void insert () struct node *nn = malloc (sizeof (*nn)); if (nn == NULL) printf("the not got a NULL Pointer! Sorry\n"); exit(0); printf ("enter the data\n"); scanf ("%d", &nn->data); nn->next = NULL; if (first == NULL) first = nn; else struct node *temp = first; while (temp->next!= NULL) CS F111 COMPUTER PROGRAMMING Page 4 of 7

5 temp->next = nn; void display () struct node *temp; temp = first; if (temp == NULL) printf ("no elements\n"); return; printf ("elements in linked list are\n"); while (temp!= NULL) printf ("%d\n", temp->data); void search() struct node *temp; temp=first; int search,count=1; if (temp == NULL) printf ("no elements\n"); return; printf("\nenter element to be searched:"); scanf("%d",&search); while(temp->next!=null) if(temp->data==search) printf("\n\nyour search node is at %d place.\n", count); else count++; temp=temp->next; void delete() struct node *temp; CS F111 COMPUTER PROGRAMMING Page 5 of 7

6 temp=first; first=first->next; temp->next=null; free(temp); int main () int op; do printf ("1.insertion\n2.Delete\n3.display\n4.Search\n5.exit\n"); printf ("enter option\n"); scanf ("%d", &op); switch (op) case 1: insert (); case 2: delete(); case 3: display (); case 4: search(); while (op!= 5); Answer 5 #include<stdio.h> typedef struct char stu_id[13], stu_name[50]; int stu_phone, stu_age; float stu_cgpa; student; main() student s[100]; int i; FILE *f; f=fopen("stu.txt","w"); if(f==null) printf("file opening error\n"); exit(0); for(i=0;i<100;i++) printf("enter the student id, name, phone no, age and cgpa\n"); CS F111 COMPUTER PROGRAMMING Page 6 of 7

7 scanf("%s%s%d%d%f", &s[i].stu_id, &s[i].stu_name, &s[i].stu_phone, &s[i].stu_age, &s[i].stu_cgpa); for(i=0;i<100;i++) initialize(f,s[i]); fclose(f); void initialize(file *fl, student st) fprintf(fl,"%s\n",st.stu_id); fprintf(fl,"%s\n",st.stu_name); fprintf(fl,"%d\n",st.stu_phone); fprintf(fl,"%d\n",st.stu_age); fprintf(fl,"%f\n",st.stu_cgpa); Practice Questions Q1. All of the above. (E) Q2. Hybrid Linked List. (B) Q3. All of them let you define new data types. (B) Q4. i) (C) ii) Infinite loop iii) iv) is supre v) struct type vi) Append vii) None of the mentioned viii) The name by which the program was invoked ix) argc-1 x) Circular linked list ***END*** CS F111 COMPUTER PROGRAMMING Page 7 of 7