• 1. 
    A queue is what?

  • Last in, first out
  • First in, first out
  • Last in, last out
  • First in, last out
  • 2. 
    When a collision occurs with a hashing function, what is one method for dealing with the collisions?

  • creating a new linked list at that index
  • creating a new array
  • creating a new hash table
  • creating a new binary tree
  • 3. 
    Records allow you to store more than one data type

  • True
  • False
  • 4. 
    Which of these is not a data structure?

  • Stack
  • Array
  • Integer
  • List
  • 5. 
    What advantage does a linked list have over an array?

  • Size of the list doesn't need to be mentioned at the beginning of the program
  • You can add or remove elements from the middle of the list.
  • The linked list doesn't have a size limit
  • All of these are true.
  • 6. 
    Hashing gives each item

  • A sequential address
  • A logarithmic address
  • No address
  • A unique address
  • 7. 
    A hash table is

  • an abstract data structure
  • an array
  • an integer
  • made of pine
  • 8. 
    When an algorithm generates the same address for different primary keys it is known as

  • Knock
  • Bang
  • Collisions
  • DoubleHash
  • 9. 
    What is returned by values[5]?

  • 9
  • 12
  • 6
  • 8
Report Question
warning
access_time
  Time