Question

1. The programming team knows they need to create a program that will use a linear data structure to complete large amounts of data manipulation very quickly. Which data structure is most appropriate?
A. array list
B. graphs
C. linked list
D. maps

2. Determine the time and space complexities of a linear search

time complexity: O(n)
space complexity: O(log(n))

time complexity: O(n)
space complexity: O(n)

time complexity: O(log(n))
space complexity: O(n)

time complexity: O(log(n))
space complexity: O(log(n))

3.Which of the following is a true statement?(1 point)
Responses

The efficiency of an algorithm measures the amount of resources it needs.
The efficiency of an algorithm measures the amount of resources it needs.

The only effort to consider regarding algorithm code is implementation.
The only effort to consider regarding algorithm code is implementation.

There are no ways to measure space complexity and time complexity.
There are no ways to measure space complexity and time complexity.

Shorter codes always have greater ease of implementation than longer codes.