Coding Interview Preparation Final graded assessment Quiz Answers

In this article i am gone to share Coursera Course: Coding Interview Preparation by Meta Week 4 | Coding Interview Preparation Final graded assessment Quiz Answers with you..

Coding Interview Preparation Final graded assessment Quiz Answers

Question 1)
Where would you most likely to be asked a series of coding related questions?

• Your technical interview.
• During the screening.
• During the take-home assignment.

Question 2)
How many representations can be made from a byte?

• 128
• 256
• 64

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

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

Question 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

Question 5)
In relation to data structures mutability refers to:

• The use of one data structure as a container to mimic another.
• The initial limitations on the size that they can grow to.
• Whether a structure can be changed after its completion.

Question 6)
To say that a list is an object infers what about this data structure?

• That it will need to have parameters configured before use.
• That it can be defined by the attributes it contains.
• That in addition to storing items it has its own in-built functions.

Question 7)
In relation to coding what is modularization?

• Wrapping the code into a function means that you can call it repeatedly in your code.
• Using the most up-to-date techniques when engaging with a coding challenge.
• A data structure that can allow you store your data in accessible chunks.

Question 8)
Which of the following are actual data structures?

• C Trees
• B Trees
• A Trees

Question 9)
What are collection classes?

• Collections that take a specific type of class.
• Classes that are used by data structures to give them extra functionality like sorting.
• Specialized classes for data storage and retrieval.

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

• True
• False

Question 11)
Space complexity is more concerned with:

• Space
• Continuum
• Time

Question 12)
What does it mean to say that an array is zero-based?

• That the index count starts at 0.
• That it can’t be changed after it has been instantiated.
• That the Big-O notation can be applied to it.

Question 13)
Which of the following is valid terminology for trees.

• Leaf
• Branch
• Root

Question 14)
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.

Question 15)
What is the mathematical process for calculating all possible binary permutations called?

• Exponentiation
• Numeration
• Factorial

Question 16)
Which is the quickest: O(n), O(2n) or O(log(n)?

• O(log(n))
• O(n)
• O(2n)

Question 17)
Which of the following are linear structures?

• Arrays
• Graphs
• Trees

Question 18)
What is in-place swapping?

• Swapping items in an array in place of creating a new structure.
• 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.

Question 19)
What is auxiliary space?

• Luxury space that can be used for extravagances.
• Additional space required to make computations.
• Space that is not really needed.

Question 20)
True or false: Lists are objects therefore can be sorted.

• True
• False

Question 21)
The process of storing results for later look up to save computation time is an example of what?

• Memoization
• Recursion
• Modularization

Question 22)
When will you be most likely be given an opportunity to show off your ability to code?

• During the Quiz
• During a technical interview
• During the screening call

Question 23)
How do computers store and represent information?

• HTML
• Java
• Binary

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

• True
• False

Question 25)
In relation to hash tables, what is meant by the load factor?

• It is how much space a hash table has.
• It relates to bucket capacity before a split is made.
• It relates to the amount of space allocated to the index table.

Question 26)
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(n)
• O(log(n))

Question 27)
Which of the following statements is true?

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

Question 28)
What would you be expecting to demonstrate in your technical interview?

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