Coding Interview Preparation - Final graded assessment

Coding Interview Preparation - Final graded assessment

  1. When will you be most likely be given an opportunity to show off your ability to code?

    • During the screening call

    • During a technical interview

    • During the Quiz

  2. How many representations can be made from a byte?

    • 256

    • 128

    • 64

  3. If an application returned a result after one computation it ran in:

    • O(n)

    • O(1)

    • O(log(n))

  4. Space complexity is more concerned with:

    • Continuum

    • Space

    • Time

  5. Which of the following are linear structures?

    • Arrays

    • Trees

    • Graphs

  6. True or false: Lists are objects therefore can be sorted.

    • True

    • False

  7. What is in-place swapping?

    • Moving values in an array if the element being added is smaller.

    • Using different types of data structures as a container to emulate certain characteristics.

    • Swapping items in an array in place of creating a new structure.

  8. Which of the following are actual data structures?

    • C Trees

    • A Trees

    • B Trees

  9. Which of the following statements are true?

    • A hash table increases space usage to increase speed.

    • A hash table decreases space usage to increase speed.

    • A hash table decreases speed to decrease space usage

  10. True or false: Dynamic programming is about using dynamic structures when coding.

    • True

    • False