Algorithms - 2nd Quiz

15 Questions | Total Attempts: 277

SettingsSettingsSettings
Please wait...
Algorithms - 2nd Quiz

Algorithms - 2nd Quiz


Questions and Answers
  • 1. 
    Dijkstra's algorithm - is a solution to the _________________ shortest path problem in graph theory. 
    • A. 

      Multiple Source

    • B. 

      Double Source

    • C. 

      None of the above

  • 2. 
    Dijkstra's algorithm only can work for directed weighted graph.
    • A. 

      True

    • B. 

      False

  • 3. 
    Which of the following case does not exist in complexity theory?
    • A. 

      Best Case

    • B. 

      Worst Case

    • C. 

      Null Case

    • D. 

      Average case

  • 4. 
    Big-O notation is used to denote ______________
    • A. 

      Reduction of functions

    • B. 

      Growth of functions

    • C. 

      None of the above

  • 5. 
    A problem that can be solved with polynomial worst-case complexity is called _____________.
    • A. 

      Tractable

    • B. 

      Unsolvable

    • C. 

      Intractable

  • 6. 
    Worst case scenario for Mergesort is ----
    • A. 

      O(n log(n))

    • B. 

      O(n)

    • C. 

      O(n^2)

  • 7. 
    Which one has the fastest growth?
    • A. 

      N*n*n*

    • B. 

      N!

    • C. 

      Nlog(n)

  • 8. 
    Which one is not the properties of algorithm?
    • A. 

      Correctness

    • B. 

      Finiteness

    • C. 

      Infiniteness

    • D. 

      Generality

  • 9. 
    Time and Space complexities are the prime concerns to measure efficiency of algorithm.
    • A. 

      True

    • B. 

      False

  • 10. 
    BFS and DFS follows _____________ and ________________ respectively.
    • A. 

      LIFO and FILO

    • B. 

      Push-Pop and Queue-Dequeue

    • C. 

      FIFO and LIFO

    • D. 

      None of the above

  • 11. 
    For snake game, we can use the following algorithms.
    • A. 

      BFS

    • B. 

      DFS

    • C. 

      MST

    • D. 

      All of the above

  • 12. 
    What is the running time of Dijkstra Algorithm?
    • A. 

      O(|V|^4 + |E|)

    • B. 

      O(|V|^2 + |E|)

    • C. 

      None of the above

  • 13. 
    The following are the applications of Dijkstra Algorithm--
    • A. 

      Routing

    • B. 

      Shortest path finding

    • C. 

      Traffic Optimization

    • D. 

      All of the above

  • 14. 
    Time complexity refers algorithm's performance regarding space.
    • A. 

      True

    • B. 

      False