Module quiz: Introduction to data structures

Module quiz: Introduction to data structures

  1. What do TSV files use to separate their data?

    • Tabs

    • Types

    • Topic

  2. Arrays are always stored on the stack?

    • No

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

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

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

    • It would throw an error.

    • It would return a warning and a message indicating the issue.

    • Nothing. There would be nothing to retrieve so it would return null.

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

    • It is the thing from which arrays are build.

    • An object that has functionality.

    • It is a blueprint for an object.

  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.

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

    • 1

    • 4

    • 2

  7. Which of the following uses a FIFO approach.

    • Queues

    • Stacks

    • Lists

  8. In relation to data structures what does synchronization mean?

    • Making a class thread safe.

    • It is something to do with swimming.

    • Relates to a measured way of increasing the size of an object.

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

    • So that the compiler can know to keep the tree balanced by comparing a number of nodes.

    • 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.

  10. Why are heaps called heaps?

    • 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.

    • Because they store a selection of different data types.