coding interview preparation coursera week 4 quiz answers

Final graded assessment

1. What would you be expecting to demonstrate in your technical interview?

  • Your general background and hobbies?
  • Your ability to code.
  • Your softskills.

2. What is the mathematical process for calculating all possible binary permutations called?

  • Exponentiation
  • Numeration
  • Factorial

3. If an array of size 5, takes 5 computations before completing. It can be said that this has a Big-O of:

  • O(1)
  • O(log(n))
  • O(n)

4. Which of the following equations can be said to be true:

  • input space = space complexity + auxiliary space
  • space complexity = input space + auxiliary space
  • auxiliary space = space complexity + input space

5. Which of the following are linear structures?

  • Graphs
  • Arrays
  • Trees

6. Which of the following statements is true?

  • LinkedLists can grow without having to copy their values when expanding.
  • Array based lists can grow without having to copy their values when expanding.
  • An array-based approach is the only way of creating a list.

7. True or false: You should leave all code used and unused when conducting a coding interview.

  • True
  • False

8. Which of the following are actual data structures?

  • C Trees
  • B Trees
  • A Trees

9. Which of the following statements are true?

  • A hash table decreases space usage to increase speed.
  • A hash table decreases speed to decrease space usage
  • A hash table increases space usage to increase speed.

10. The process of storing results for later look up to save computation time is an example of what?

  • Modularization
  • Memoization
  • Recursion

Leave a Reply