Review Questions on Intro to Data Structures

  1. 1 point
    Which of the following has O(n*logn)?
  2. 1 point
    You are waiting in line at a bank. The structure of the line can best be modeled using which of the following?
  3. 1 point
    Which of the following data structures is a FIFO?
  4. 1 point
    If you wanted to store a large set of data and then be able to tell if a new piece of data was already in storage what would you use?
  5. 1 point
    Is it easy or hard to insert a new element into the middle of a linked list and why?
  6. 1 point
    Which of the following data structures is not included in the Java Collections Framework?
  7. 1 point
    You have implemented a Hash Table. You get a new datum (piece of data) that is not currently in the table and so has to be added to the table. However, this datum causes a collision. What has happened?
  8. 1 point
    You are considering implementing a Queue using either an array or a linked list. Which of the following would be an advantage of using the linked list approach.
  9. 1 point
    For which of the following cases is hashing not likely to be used?
  10. 1 point
    Is the following a tree? Is it a binary tree?