Exam 2 - Key - CS 2050 Exam 2 Fall 2009 INSTRUCTIONS: Mark...

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

View Full Document Right Arrow Icon
CS 2050 Exam 2 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)
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 / 2

Exam 2 - Key - CS 2050 Exam 2 Fall 2009 INSTRUCTIONS: Mark...

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