All Coursera Quiz Answers

Module quiz: Introduction to data structures Quiz Answers

In this article i am gone to share Coursera Course: Coding Interview Preparation by Meta Week 2 | Module quiz: Introduction to data structures Quiz Answers with you..

Also visit:  Module quiz: Introduction to the coding interview Quiz Answers


Module quiz: Introduction to data structures Quiz Answers

Question 1)
What do TSV files use to separate their data?

  • Topic
  • Types
  • Tabs

Question 2)
Arrays are always stored on the stack?

  • Yes, but only through making a shallow-copy.
  • Yes, but only through making a deep-copy.
  • No

Question 3)
What happens when you try to retrieve a value using a number greater than the index size?

  • It would return a warning and a message indicating the issue.
  • It would throw an error.
  • Nothing. There would be nothing to retrieve so it would return null.

Question 4)
In relation to computer science, what is a class?

  • It is a blueprint for an object.
  • It is the thing from which arrays are build.
  • An object that has functionality.

Question 5)
In relation to objects, what are instance variables?

  • An attribute that has an immediate impact when compiled.
  • Attributes that can take on many forms.
  • Characteristics of the class.

Question 6)
How many children can a node in a binary tree have?

  • 2
  • 1
  • 4

Question 7)
Which of the following uses a FIFO approach.

  • Lists
  • Stacks
  • Queues

Question 8)
In relation to data structures what does synchronization mean?

  • Relates to a measured way of increasing the size of an object.
  • It is something to do with swimming.
  • Making a class thread safe.

Question 9)
Why do you need to implement a comparator when storing objects on a tree?

  • To ensure that values don’t clash when being added to a tree.
  • As a means of comparing objects so the tree knows which node to store an object on.
  • So that the compiler can know to keep the tree balanced by comparing a number of nodes.

Question 10)
Why are heaps called heaps?

  • Because they store a selection of different data types.
  • The order of importance is determined by where in the data structure the information is found.
  • The organization of their data is done in a very loose way, so it is said that the elements are heaped together.