EEE Algorithms & Data Structures Final Exam Instructor: Dr. Hasan Demirel

Size: px

Start display at page:

Download "EEE Algorithms & Data Structures Final Exam Instructor: Dr. Hasan Demirel"

Candice Lee
6 years ago
Views:

1 Name: Date: 04 January 2005 Number: EEE Algorithms & Data Structures Final Exam Instructor: Dr. Hasan Demirel T Read the Following Instructions Carefully: 1. The duration of the exam is strictly 150 minutes. No extra time will be given. 2. Answer each question to a separate sheet on your answers booklet. Q U E S T I O N S & SOLUTIONS 1. The weekly football match records of football team is kept by using the following structure: Name of the opponent (the other team) Number of goals scored Number of goals received DATE of the match (Assume that DATE is another type which contains day, month and year) (a) (%5) Create a new data type, FOOTBALL, to represent the data structure of such a record. Note that DATE data type must also be created. typedef struct int day; int month; int year; DATE; typedef struct char name[20]; int scored; int received; DATA d; FOOTBALL; (b) (%10) Write the definition of a function called TotalPoints to calculate and return the total points of a team in a year. Note that in a football match winning is 3 points, equality is 1 point and loosing is 0 points. int TotalPoints(FOOTBALL *tpt, int size) int i,total=0; for(i=0;i<size;i++) if( (tpt+i)->scored > (tpt+i)->received) total=total+3; else if( (tpt+i)->scored == (tpt+i)->received) total=total+1; return total;

2 (c) (%10) Write the definition of a function called BestMatch which displays the full record of the winning match with the highest number of goals scored. void BestMatch (FOOTBALL *tpt, int size) int i,highest=-1,pos; for(i=0;i<size;i++) if( (tpt+i)->scored > (tpt+i)->received) if( (tpt+i)->scored > highest) highest = (tpt+i)->scored; pos=i; if(highest > -1) printf( Best winnig Match Details:\n ); printf( Oponent:%s\n,(tpt+i)->name); printf( Goals Scored:%d\n,(tpt+i)->scored); printf( Goals Received:%d\n,(tpt+i)->received); printf( Date:%d,%d,%d\n,(tpt+i)->d.day,(tpt+i)->d.month,(tpt+i)->d.year); else printf( There si no winning match\n ); 2. Consider a stack data structure which contains the records of the matches about the football team given in question 1. (a) (%5) Create a suitable data type, STACK, for a stack structure containing FOOTBALL data structure as its elements. #define STACKSIZE 52 /*number of weeks in a year*/ typedef struct int top; FOOTBALL items[stacksize]; STACK; (b) (%10) Write the definition of a function, DispJanMatches to display the full records of the matches in January. The following function prototype can be used. void DispJanMatches(STACK *sptr); void DispJanMatches(STACK *sptr) int t = sptr->top; if(sptr->top == -1) printf( Stack is Empty!!\n ); exit(1); while(sptr->top!= -1) if( sptr->items[sptr->top].d.month == 1) printf( Oponent:%s\n, sptr->items[sptr->top].name); printf( Goals Scored:%d\n, sptr->items[sptr->top].scored); printf( Goals Received:%d\n, sptr->items[sptr->top].received); printf( Date:%d,%d,%d\n,sptr->items[sptr->top].d.day, sptr->items[sptr->top].d.month,sptr->items[sptr->top].d.year); sptr->top --; sptr->top = t;

3 (c) (%10) Write the definition of a function AvrScored to calculate and return the average of the goals scored in a year. The following function prototype can be used. float AvrScored (STACK *sptr); float AvrScored (STACK *sptr) int sum = 0, count=0, t = sptr->top; if(sptr->top == -1) printf( Stack is Empty!!\n ); exit(1); while(sptr->top!= -1) sum = sum + sptr->items[sptr->top].scored; sptr->top --; count++; sptr->top = t; return (float)sum/count; 3. Consider a doubly circular linked list, where each node contains the name of a company, the budget of the company as well as the number of employees (workers) in that company. (a) (%5) Write an appropriate node structure definition for the records of the doubly circular linked list. typedef struct char name[20]; float budget; int employee; COMPANY; struct node COMPANY info; struct node *left; struct node *right; ; typedef struct node nodeptr; (b) (%15) Assume that the doubly circular linked list contains only a single node which is the header node with a sentinel -1 as the number of employees. Given an array where the records of different companies are stored as elements of the array. Write the definition of a function where the elements of the array are copied/inserted into the doubly linked list in ascending order according to the budget of each company. void CopyArray(nodeptr *dlist, COMPANY *aptr, int size) int i; nodeptr *p=dlist; SORT(aptr,size); /*this function will sort the input array*/ for(i=0;i<size;i++) insertright(p,*(aptr+i)); p = p->right; void SORT(COMPANY *aptr, int size) int i,j; COMPANY hold; for(i=0;i<= size-1;i++)

4 for(j=0;j<= size-2;j++) if( (aptr+j)->budget > (aptr+j+1) ->budget ) hold =*(aptr+j); *(aptr+j) = *(aptr+j+1); *(aptr+j+1)= hold; void insertright(nodeptr *p, COMPANY x) nodeptr *q,*r; if(p == NULL) printf( void insertion\n ); return; q = getnode(); /* assumed to be allocating necessary node space */ q->info = x; r = p->right; r->left = q; q->right = r; q->left = p; p->right = q (c) (%10) Given a sorted doubly linked list according to the choice (b). Write a function to display the names of the companies with minimum and maximum budgets. void MinMaxBudget(nodeptr *dlist) nodeptr *rp, *lp; rp = dlist->right;/* sorted list, therefore rp points the minimum */ lp = dlist->left;/* sorted list, therefore lp points the maximum */ printf( Company infor with Minimum Budget\n ); printf( Name:%s\nBudget:%.2f\nEmployee:%d\n\n,rp->info.name, rp->info.budget, rp->info.employee); printf( Company infor with Maximum Budget\n ); printf( Name:%s\nBudget:%.2f\nEmployee:%d\n\n,lp->info.name, lp->info.budget, lp->info.employee); 4. Consider a Binary Search Tree where each node contains the Course Name, Course Code and Course Grade Average. The Binary Search Tree is ordered according to the Course Grade Average. (a) (%5) Write an appropriate node structure for the Binary Search Tree. struct node char Cname[20]; int Ccode; float CGA; struct node *left; struct node *right; ; typedef struct node nodeptr;

5 (b) (%15) Write the definition of a function which swaps the contents of the root node and the content of the node with the highest Course Grade average. Note: If you traverse a Binary Search Tree by following the right branch you can get to the node with highest Course Grade Average. void RootSwap(nodeptr *root) nodeptr *p; int holdccode; float holdcga; char *holdname; p = root; while(p->right!= NULL) p = p->right; holdccode = p->ccode; /*swapping the Course Codes*/ p->ccode = root->ccode; root->ccode = holdccode; holdcga = p->cga; p->cga = root->cga; root->cga = holdcga; /*swapping the Course CGA*/ holdcname = p->cname; /*swapping the Course Names*/ p->cname = root->cname; root->cname = holdcname;

struct node{ int info; struct node left, right; }; typedef struct node nodeptr; A Linear Doubly Linked List

struct node{ int info; struct node *left, *right; }; typedef struct node nodeptr; A Linear Doubly Linked List 1 EEE 212 Algorithms & Data Structures Spring 05/06 Lecture Notes # 13 Outline Doubly Linked Lists Linear & Circular Doubly Linked Lists Primitive Functions in Doubly Linked Lists Application of the Doubly