Duration: 110 minutes

Size: px

Start display at page:

Download "Duration: 110 minutes"

Russell Williams
6 years ago
Views:

1 EASTERN MEDITERRANEAN UNIVERSITY Computer Engineering Department CMPE-231 DATA STRUCTURES FINAL EXAMINATION 13 June 2014 Duration: 110 minutes Name, Surname. SOLUTION KEY Student ID # Grading: Please, check your exam sheet and make sure that it contains 7 questions.in case of any missing pages, inform the invigilator IMMEDIATELY! Q1. /10 Q2. /12 Q3. /12 If an Answer Box is provided in a question, you MUST give your answer (and nothing else) in the corresponding box. Otherwise, you will get NO MARKS from that question Q4. /12 Q5. /18 Q6. /18 Q7. /18 Total

2 C programming language: Operators OPERATORS ASSOCIATIVITY ( ) [ ] ->. Left to right! * & (type) sizeof Right to left (Unary) * / % Left to right + - Left to right < <= > >= Left to right ==!= Left to right && Left to right Left to right?: Right to left = += -= *= /= %= Right to left, Left to right

3 Q1) (10 points) What is the binary tree representing the following arithmetic expression: Ans: F (A+B)$C$(D+E) - F $ + $ A B C + D E

4 Q2) (12 points) Consider the following sequence of numbers: a) Construct(draw) a binary search tree for sorting the sequence in ascending (increasing) order. Ans: b) Give the postorder traverse of the tree

5 Q3) (12 points) Consider the following C function: int fun(int x) if (x < 5) return (3*x); else return(2*fun(x - 5) + 7); What would be returned if fun is called as fun(16) 73 fun(8) 25 Q4) (12 points) The following code describes a recursive C function for the binary search algorithm. However, some parts of the code given below are missing. Fill in those missing parts indicated by. int binsrch(int *a, int x, int low, int high) int mid; if(low > high) return -1; mid = (low + high)/2; if(x == a[mid]) return mid; else if(x < a[mid]) return binsrch(a, x, low, mid-1) ; else return binsrch(a, x, mid+1, high) ; Note that the function searches the item x within the range a[low] to a[high].

6 Q5) (18 points) Assume that a linked list pointed to by list contains the data as shown in the figure. list What will the contents of the list be after calling the function modify( ) (see definition below) as modify(list);? struct node int info; struct node * next; ; void fun(struct node * p, int x) struct node * q; q = (struct node *) malloc(sizeof(struct node)); q -> info = x; q -> next = p -> next; p -> next = q; void modify(struct node * list) struct node * qq; int x = 5; for(qq = list; qq!= NULL; qq = qq -> next) if(qq -> info = = 2) fun(qq, x += 2);

7 Q6) (18 points) Consider the array implementation of the circular queue defined by the following code: #define MAXQUEUE 4 struct queue char items[maxqueue]; int front, rear; q; q.front = q.rear = MAXQUEUE 1; //Initialization Assume that we insert the item A into the queue q. The queue then appears as follows: A q.front = 1, q.rear = 2 Show the contents of the queue and the values of q.front and q.rear after each of the steps given below. If an error occurs at a step, say error and explain the reason for the error. i.) Insert B to the queue that already contains one item A as above. A B q.front = 1, q.rear = 3 j.) Insert C to the queue of part i.) C A B q.front = 1, q.rear = 0 k.) Remove an item from the queue of part j.) C B q.front = 2, q.rear = 0

8 l.) Remove an item from the queue of part k.) C q.front = 3, q.rear = 0 m.) Insert D to the queue of part l.) C D q.front = 3, q.rear = 1 n.) Insert E to the queue of part m.) C D E q.front = 3, q.rear = 2 o.) Insert F to the queue of part n.) C D E q.front = 3, q.rear = 2 Error! The queue is full.

9 Q7) (18 points) The following code describes some functions associated with the C implementation of the linked lists. However, some parts of the code given below are missing. Fill in those missing parts indicated by. The comments given before each function explains what that function is supposed to perform. struct node int info; struct node *next; ; int empty(struct node ** plist) return * plist = = NULL? 1 : 0; /* The following function inserts a node to the beginning of the linked list. */ void ins_begin(struct node ** plist, int x) struct node * p; p = (struct node *) malloc(sizeof(struct node)); p -> info = x; if(empty(plist)) *plist = p ; p->next = NULL ; else p->next = *plist ; *plist = p ; /* The following function returns a pointer to the first occurrence of x within the list and the NULL pointer if x does not occur in the list. */ struct node *search(struct node *list, int x) struct node *p; for(p = list; p!= NULL; p = p->next ) if(p -> info == x) return p ; return NULL; // continues on the next page!

10 /* The following function inserts an item x after the node pointed to by p. */ void ins_after(struct node *p, int x) struct node *q; if (p = = NULL ) printf( void insertion\n ); exit(1); q = (struct node *) malloc(sizeof(struct node)); q -> info = x; q->next = p->next ; p->next = q ;

CMPE231 DATA STRUCTURES FINAL EXAMINATION / FALL 2010

EASTERN MEDITERRANEAN UNIVERSITY Computer Engineering Department CMPE231 DATA STRUCTURES FINAL EXAMINATION / FALL 2010 Lecturers: Prof.Dr.Marifi Güler (group 1) Prof.Dr.Erden Başar (group 2) January 14,