Download Member Function - Data Structures - Exam and more Exams Data Structures and Algorithms in PDF only on Docsity!
Data Structures, Sample Test 1, with Answers
- A doubly linked list is based on the following data:
class DoubleList{ // public function declarations here ... private: struct DoubleNode{ ListItemType item; // data in the node DoubleNode* next; // points to next node DoubleNode* precede; // points to previous node }; DoubleNode* head; // points to first node };
(a) Write a member function void DoubleList::removeFirstNode() which deletes the first node from a doubly linked list. (b) Assume the DoubleNode* variable curr points to a node in our dou- bly linked list. Write a few lines of code to remove this node curr from the list. (Be careful: what should happen if curr is at the beginning or end of the list?) (c) Write a member function DoubleList::DoubleNode DoubleList::find(int index) which returns a pointer to the node at position index in the doubly linked list. Your function should return NULL if the index is out of range (note our class DoubleList does not have a size data member: how can you determine if index is out of range in this case?)
- What is the output (to the screen) of the following program? Be sure you pay attention to all the cout statements.
#include int binarySearch(const int anArray[], int first, int last, int value){ cout << "binarySearch: first = " << first << ", last = " << last << ".\n"; if (first>last) return -1; else{ int mid = (first + last)/2; if (value == anArray[mid]) return mid; else if (value < anArray[mid]) return binarySearch(anArray, first, mid-1, value); else return binarySearch(anArray, mid+1, last, value); } // end else } // end binarySearch int main(){ int a[] = {1,4,5,10,12,18,25,31,107}; cout << binarySearch(a,0,8,12) << endl; cout << binarySearch(a,0,8,15) << endl; }
- What is the output of the following program?
#include #include int main(){ for (int i=1; i<=3; ++i){ try{ if (i%2 == 0) throw exception(); cout << "i is now " << i << endl; } // end try catch (exception e){ cout << "error\n"; } // end catch } // end for } // end main
- Consider the ADT List operations
(a) Create an empty list. (b) Destroy a list. (c) Determine whether a list is empty. (d) Determine the number of items in a list. (e) Insert an item at a given position in the list. (f) Delete the item at a given position in the list. (g) Look at (retrieve) the item at a given position in the list.
Using only the ADT List operations (a)-(g) above, describe how to replace an item at a given position on a list with a new item. (So, for example, given the list of integers 0,3,8,9,4,10, if the fourth item is to be replaced with a 7, the new list will be 0,3,8,7,4,10.) You may write your answer in (precise) words, in pseudocode, or in representative C++ code.
Answers
- (a) void DoubleList::removeFirstNode(){ if (head != NULL){ DoubleNode* temp = head; head = head->next; delete temp; temp = NULL; if (head != NULL) head->precede = NULL; } } (b) DoubleNode* prev = curr->precede; DoubleNode* following = curr->next; if (prev != NULL) prev->next = following; if (following != NULL) following->precede = prev; delete curr; (c) DoubleList::DoubleNode* DoubleList::find(int index){ if (index<1) return NULL; DoubleNode* curr = head; for (int i=1; i<index; ++i){ if (curr == NULL) return NULL; curr = curr->next; } // end for return curr; }
- binarySearch: first = 0, last = 8. 4 binarySearch: first = 0, last = 8. binarySearch: first = 5, last = 8. binarySearch: first = 5, last = 5. binarySearch: first = 5, last = 4.
- i is now 1 error i is now 3
- (a)
head
- โโ 5 โข โโ 3 โข โโ 4 โข โโ 7 โข โโ 12 โข โโ 10 NULL
(b) 3
