FE F09 - Key - CS 2050 Final Exam Fall 2009 INSTRUCTIONS:...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Final Exam Fall 2009 INSTRUCTIONS : Mark the single best answer for each question. Unless otherwise stated, the dataset in each question has O(N) size. A simple linked list is defined as a singly-linked list of nodes accessed through a pointer to the head of the list (e.g., no other pointers can be assumed which directly access other nodes in the list). 1. A stack can be used to implement the Undo operation in a software application so that any number of actions can be undone. What ADT would best support a Redo operation to allow any number of undone actions to be reapplied? *(1) Stack (2) Queue (3) Priority Queue (4) BST (5) None of the above ADTs naturally facilitates the implementation of the Redo operation. 2. Which of the following is not a data structure? If all of them are data structures then mark (4). If none are data structures then mark (5). (1) Stack (2) Queue (3) Priority Queue (4) All of the above are data structures. *(5) None of the above are data structures. 3. Suppose you use a simple linked list to implement a queue for an application which only requires enqueue operations (i.e., it can be assumed that no dequeue operations will ever be performed). What is complexity to perform O(N) enqueue operations? (1) O(1) (2) O(log(N)) *(3) O(N) (4) O(N 2 ) (5) O(N!) 4. What is the complexity to perform a mix of O(N) enqueue and dequeue operations in the application of the previous question if it is assumed that only a small percentage are dequeue operations? (1) O(1) (2) O(log(N)) (3) O(N) *(4) O(N 2 ) (5) O(N!) 5. Suppose you are given a set of keys stored in sorted order in a doubly-linked list with pointers to the head and tail of the list. What is the complexity to find a specified key? (1) O(1) (2) O(log(N)) *(3) O(N) (4) O(N*log(N)) (5) O(N 2 ) 6. Suppose a queue is implemented using a circular doubly-linked list with a pointer pointing to the front of the queue. What is the complexity of the dequeue operation? *(1) O(1) (2) O(N) (3) O(N 2 ) (4) Ackerman(N) (5) Towers of Hanoi 7. Suppose that you are given a binary search tree. What is the complexity to insert a key as a new leaf node? (Note that the insertion must maintain the BST property) (1) O(1) (2) O(log(N)) *(3) O(N) (4) O(N*log(N)) (5) O(N 2 ) 8. What is the complexity for the previous question if size fields are included in each node? (1) O(1) (2) O(log(N)) *(3) O(N) (4) O(N*log(N)) (5) O(N 2 ) 9. What is the complexity for the previous two questions if the tree is balanced? (1) O(1) *(2) O(log(N)) (3) O(N) (4) O(N*log(N)) (5) O(N 2 ) 10. Suppose that you are given a binary tree (not a BST). What is the complexity to insert a key as a new leaf node? (1) O(1)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/06/2010 for the course CS 2050 taught by Professor Uhlmann during the Fall '09 term at Missouri (Mizzou).

Page1 / 4

FE F09 - Key - CS 2050 Final Exam Fall 2009 INSTRUCTIONS:...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online